On Thursday 01 May 2008, mhampton wrote: > I'm sure Martin will answer this, but I suspect is an oversight based > on common usage patterns - for most Groebner basis calculations, the > overhead of pexpect is insignificant.
Yes, this is one reason. Another reason is that interrupting the calculation is much easier over pexpect. Third, note that you are potentially using different algorithms: I.groebner_basis() calls the groebner heuristic function while libsingular:std calls the standard Buchberger directly. We would use the excellent heuristics of Singular since they are implemented as Singular script. Martin -- name: Martin Albrecht _pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99 _www: http://www.informatik.uni-bremen.de/~malb _jab: [EMAIL PROTECTED] --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com 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 -~----------~----~----~----~------~----~------~--~---
