> Is it actually true that if NP-complete problems could be solved in > deterministic polynomial time that Sage would be faster?
No. Because knowing they are equal does not mean we can write faster algorithms. I would be amazing if the proof of P=NP contained a way to optimize at once all the algorithms we have found until now. And being able to solve 3-SAT in time O( n^99999 ) would not do us any good :-) 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
