TITLE: How valid is the proposed P=NP solution for the 3-SAT problem?
QUESTION [7 upvotes]: 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.

REPLY [2 votes]: I like most people don't read P=NP? proofs. There seems to be something missing in the current approaches.
I have an approach that only lacks one step from resolving the issue. I only need to determine the complexity of determining membership in a fractal set. Decades more of work by me and I am sure I can resolve the final issues. Or not.