On Wed, Jul 14, 2010 at 11:51 PM, Nathann Cohen <[email protected]> wrote: > As such a polynomial will grow very large, very quickly, I would like > to know which would be the best way to compute it. I already know > things like the degree of the final polynomial, if it can help.
Have you tried using the default polynomials in Sage (which use libsingular)? > If there is no tool efficient tool to do this already, would you think it > easy to write in C ? (I do not know how to deal with *large* numbers > -- I used mpfr a long time ago and it may be a good answer) Bill Hart has been spending some effort writing a C library for multivariate polynomial multiplication, but it isn't polished yet at all. --Mike -- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
