Hi Travis, On 2017-09-02, Travis Scrimshaw <tsc...@ucdavis.edu> wrote: > sage: R.<x,y,z,t> = ZZ[] > sage: %time f = (1+x+y+z+t)^30 > CPU times: user 232 ms, sys: 0 ns, total: 232 ms > Wall time: 241 ms > sage: g = f+1 > sage: %time temp = f * g > CPU times: user 16min 34s, sys: 8 ms, total: 16min 34s > Wall time: 16min 34s > sage: 16 * 60 + 34 > 994 > > From Ulrich's timings, it seems like we are still loosing quite a lot in > converting to/from singular.
Is it really the *conversion*? I wouldn't be surprised if that example would take a long time in Singular without a conversion. The polynomials in Singular are not optimised for arithmetics but for Gröbner basis computations, which (as I was told some time ago) are two totally different things. Best regards, Simon -- 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.
