Hi, How come we use the pexpect interface for singular to compute the groebner basis as the default? It seems to me we should be using malb's excellent libsingular wrapper.
sage: R.<x,y> = PolynomialRing(QQ,order='degrevlex') sage: I=(x^2+3*x*y/2+y^2/2-3*x/2-3*y/2,x*y^2-x,y^3-y)*R sage: %timeit I.groebner_basis() 10 loops, best of 3: 2.05 ms per loop sage: %timeit I.groebner_basis(algorithm='libsingular:std') 10000 loops, best of 3: 72.5 µs per loop Cheers, Yi http://yiqiang.org --~--~---------~--~----~------------~-------~--~----~ 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-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
