Source link: http://romvf.wordpress.com/2011/01/19/open-letter/ (Referred from slashdot)
The fact of existence of the polynomial algorithm for 3-SAT problem leads to a conclusion that P=NP.
Is there validity to this argument that there is a P=NP solution? How long till this can be verified? Will this take years to verify or more likely weeks?
Final update:
http://cartesianproduct.wordpress.com/2011/02/27/no-proof-of-pnp-after-all-yet/
Vladimir Romanov has conceded that his published “proof” of P=NP is flawed and requires further work.