On Nov 13, 4:41 pm, "Ondrej Certik" <[EMAIL PROTECTED]> wrote:
> Hi,
>
> Martin Albrecht just pointed to me his nice code for calculating groebner
> basis:
>
> http://www.sagemath.org/hg/sage-main/file/ce4aa966e4c1/sage/rings/pol...
>
> which is better than the one we use in SymPy currently. This should
> speed up the factorization, right? How about implementing it in SymPy?
> Robert? :)
>
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've lost my hope on the univariate integer polynomial factorization
already, that's why i stopped implementing the other corresponding
algorithms.
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
