On Sat, Aug 22, 2009 at 2:40 PM, Harald Schilly <harald.schi...@gmail.com>wrote:
> > On Aug 22, 11:08 pm, "Dr. David Kirkby" <david.kir...@onetel.net> > wrote: > > > If that whole thing could be implemented, it would make for interesting > > results. Karl might even want to provide a link to Sage results! > > And I would like to put it on the website ;) > > It might be useful/fair to add other benchmarks, representative for > Sage and comparing to Mathematica? I think of Bernoulli numbers (since > they have blogged so proudly about it) and > > sage: R.<x,y,z> = PolynomialRing(GF(13)) > sage: time _ = expand((x+y+z+1)**100) > CPU times: user 0.07 s, sys: 0.00 s, total: 0.08 s > Wall time: 0.08 s > > In[1]:= Timing[Expand[(x+y+z+1)^100, Modulus -> 13]][[1]] > Out[1]= 4.20826 > > maybe something similar for BooleanPolynomialRings? And put determinants and charpolys of large random integer matrices. Also, put "multiplying two enormous integers". William -- William Stein Associate Professor of Mathematics University of Washington http://wstein.org --~--~---------~--~----~------------~-------~--~----~ To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
