I'd like to point out that recently http://trac.sagemath.org/ticket/12375 was closed. I'd like also to thank here all the participants.
Since sage 6.8.beta5, giac and its cython interface giacpy are avaible as optional packages. It provides interesting features in symbolic computations (gcd, factor, solving more inequalites) and also in groebner basis computation: Ex: I was able to compute a groebner basis over QQ of cyclic9 in 7h of wall time (but 49h of cpu time). (7h30 wall and cpu time with magma) http://webusers.imj-prg.fr/~frederic.han/xcas/giacpy/index.html#cyclic9 * the giacpy result was saved to a 1.1G file in 28s, loaded in 68s, converted to a list of sage polynomials in 170s.*computation of groebner basis over prime fields p<2**31 are also avaible: Ex: *Katsura12 mod 65521 took 90s with giacpy and 810s with libsingular.http://webusers.imj-prg.fr/~frederic.han/xcas/giacpy/grobner-libgiac.pdf* -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
