These are chat archives for symengine/symengine
@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?