Is it actually true that if NP-complete problems could be solved in deterministic polynomial time that Sage would be faster?
Bill. On 10 Aug, 16:23, Ben Edwards <bjedwa...@gmail.com> wrote: > How much faster all of sage could be! > > On Aug 9, 9:45 pm, Nathann Cohen <nathann.co...@gmail.com> wrote: > > > > > -1 > > > I am hoping the two of them are equal :-D > > > Nathann > > > On Aug 10, 10:55 am, Ben Edwards <bjedwa...@gmail.com> wrote: > > > > Just because there are a number of mathematicians on the list there is > > > a potential proof of P!=NP out there that is being taken fairly > > > seriously. > > > >http://rjlipton.wordpress.com/2010/08/08/a-proof-that-p-is-not-equal-... -- 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
