In my own experience, coding with an univariate polynomial is not efficient especially if the polynomial is sparse. I'm using heapmult or Lagrange interpolation in giac for polynomials represented as sparse distributed polynomials, with monomials coded as integers if they fit. I also experienced that recursive representation was slower than heap multiplication for total degree fixed. It depends a lot on the polynomials: if they have a total degree bound, or partial degree bounds, and how sparse they are (or are not).
-- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
