imatfaal Posted January 20, 2011 Share Posted January 20, 2011 Vladimir Romanov has released source code for an algorithm which he claims can solve 3-SAT problems. The 3-SAT problem is NP-complete - and Romanov claims his algorithm will solve in polynomial time, this would prove that P==NP as all NP problems can be mapped within polynomial time to the satisfiability problem. With such a seemingly easily falsifiable claim Romanov might be proved wrong quite quickly - for any with the maths and compsci skill here is Romanov's announcement and links to the source code and article - and for those who need a bit more background here is a link to a long slashdot ramble that has some good stuff in it 1 Link to comment Share on other sites More sharing options...
Recommended Posts