These are chat archives for symengine/symengine

17th
Mar 2015
Shivam Vats
@shivamvats
Mar 17 2015 19:58 UTC

@certik I have a query regarding Kronecker's substitution. For univariate polynomial multiplication, we evaluate the polynomials at suitable numbers (Say 10^3 or 2^n) and then multiply the resulting integers.
In case of multivariate polynomials, instead of a tuple, we convert the exponents into an integer and use that integer as a key in a hashtable.

So, in the former, there is only one integer multiplication, while in the second, there will be multiple additions of integer keys and multiplication of coefficients. Are they fundamentally, the same or do we expect one to be faster than the other?

Ondřej Čertík
@certik
Mar 17 2015 23:17 UTC
@shivamvats, good question. I think they are fundamentally different. You should concentate on the multivate case. That will also work for univariate case, though it will probably be slower than the specialized method for univariate case.