Anyway we should definitely get some multivariate polynomial arithmetic over Z based on flint and keep singular for groebner bases or things it is meant for.
On Monday, September 4, 2017 at 7:13:59 AM UTC+2, parisse wrote: > > > > Le dimanche 3 septembre 2017 16:06:46 UTC+2, rjf a écrit : >> >> I was doing timing on the same task and found that one system >> (used for celestial mechanics) was spectacularly fast on a test just like >> this one. >> One reason was that it first changed f*(f+1) to >> >> f^2 +f >> and was clever in computing f^2. You should be clever >> at this too. >> >> Anyway, be careful when you are testing. >> >> > giac does not cheat, it does the product f*(f+1) not f^2+f. For more > details, you can have a look at Bill Hart blog: > > http://wbhart.blogspot.fr/2017/07/update-on-fast-multivariate-polynomial.html > -- 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 https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
