On Sun, Nov 22, 2009 at 11:08 AM, Nathann Cohen <[email protected]> wrote: > Hello everybody !!!! > > During the review of http://trac.sagemath.org/sage_trac/ticket/7364, > Florent Hivert mentionned it could be a great idea to add a > "complexity" note in all of our algorithms, and some informations > about optimality if known ( or even approximations if available, etc > ... ). What do you think of it, and what would you think of such > information as "required" before giving a positive review to patches ?
I'm strongly against requiring this, but certainly for encouraging it and establishing a good format. William > Nathann > > -- > To post to this group, send an email to [email protected] > To unsubscribe from this group, send an email to > [email protected] > For more options, visit this group at > http://groups.google.com/group/sage-devel > URL: http://www.sagemath.org -- William Stein Associate Professor of Mathematics University of Washington http://wstein.org -- To post to this group, send an email to [email protected] To unsubscribe from this group, send an email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
