> No, a faster Groebner basis wouldn't help with factorization, neither > univariate nor multivariate. It is used for multivariate gcd though, > which should be avoided in itself, regardless of the quality of > Groebner.
I see. So what could be done to speed up the factorization? > I've lost my hope on the univariate integer polynomial factorization > already, that's why i stopped implementing the other corresponding > algorithms. Could you please ellaborate? I don't understand what is the problem with integer polynomial factorization. Ondrej --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "sympy" group. 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/sympy?hl=en -~----------~----~----~----~------~----~------~--~---
