On Feb 5, 10:20 am, Simon King <k...@mathematik.uni-jena.de> wrote: > In some application, I had to compute a Gröbner basis for a system of > about 30000 non-homogenous polynomials of degree 3 with 42 variables > and with rational coefficients. But Singular (which does the Gröbner > basis computation in Sage) only needed a few hours.
I forgot to add: Of course, there are systems that look much smaller, but for which it is practically impossible to compute a Gröbner basis. So, my positive experience is no guarantee for your case... Cheers Simon --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
