Open Letter

Dear Fellow Researchers, Would you kindly pay attention to the article “Non-Orthodox Combinatorial Models Based on Discordant Structures” by the author V. F. Romanov published on arXiv.org: http://arxiv.org/abs/1011.3944 (download: PDF, initial format LaTeX, 12pt). The article presents a constructive proof of effective resolvability of 3-SAT problem, accompanied by description of a polynomial algo

[yowa]

3SAT in P ?

[Luigitefu]

P=NP？

[mrkn]

"The fact of existence of the polynomial algorithm for 3-SAT problem leads to a conclusion that P=NP."