Hello everybody !!! I would like to write some graph-theoretical function which involves large polynomials. Actually, what I have is the following : to each vertex of my graph is associated a variable, and I want to compute the product over all the edges u,v of (X_u - X_v). I am then just interested in reading the coefficients of its expansion..
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. 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) Thank you for your help !!! :-) Nathann -- 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
