Tuesday, April 7, 2009
Proof
P=NP has been proven on the arXiv.org archive. Please email us your thoughts and comments or reply on this and any other board discussing computational complexity and this paper.
Best regards,
Martin Musatov
http://arxiv.org/abs/cs/0406056
1 comments:
Anonymous said...
There are cases when the soap does not form the shortest path....
September 3, 2010 12:24 AM
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
1 comments:
There are cases when the soap does not form the shortest path....
Post a Comment