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/polynomial/toy_buchberger.py 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? :) We have the permission to use it in SymPy and relicense it to BSD. 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 -~----------~----~----~----~------~----~------~--~---
