Le lundi 9 mai 2016 09:18:53 UTC+2, john_perry_usm a écrit : > > > For the homogeneous cyclic-8, > > > int RT = rtimer; int T=timer; size(sba(k,0,0)); rtimer-RT; timer-T; > 1182 > 6854 > 5113 > > Strange figures: I get 455 for the first (which is correct for the basis size, while 1182 is wrong), and a little less than 13s for the timings, indeed faster than singular groebner but still 10 to 4* slower than mgb/fgb/giac f4 .. and you must dig into singular documentation! I'm not convinced it's really worth spending time implementing signature algorithms anyway (and it seems Roman Pearce and Allan Steel share the same feeling), f4 seems good enough for modular computations, and for computations over Q with modular algorithms, you can discard useless pairs using the first modular run.
-- 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.
