Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

Univariate Polynomial Multiplication

What algorithms does sage use for univariate polynomial multiplication?

In particular, I am curious about the algorithm used for multiplication over finite fields and polynomials with coefficients in Z or Q.

More generally, is there an easy way to look under the hood and trace down the exact functions being called in the event I have a question like this again?