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 ?
Nathann -- 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
