On Friday, April 15, 2011, kcrisman <kcris...@gmail.com> wrote: > Just curious if anyone was working on implementing > http://aimath.org/news/partition/brunier-ono for number_of_partitions, > or if this is something useful to do (seems to involve both heavy > modular form work and numeric approximation to ensure algebraic > numbers are sufficiently approximated. > > I'm not suggesting there's anything wrong with "Jonathan Bober's > highly optimized implementation (this is the fastest code in the world > for this problem)." as in the docs, just curious, as these papers > attracted a fair amount of attention. Maybe it's not realistically > even implementable at this time? >
It isn't and even if it were I would be (pleasantly) surprised if it could be any any faster than the code in Sage already. Unfortunately, I think their result may be mainly of theoretical (and marketing?) interest.... William > - kcrisman > > -- > 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 > URL: http://www.sagemath.org > -- William Stein 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 URL: http://www.sagemath.org
