Reduction of the solution of the NP-complete “3-satisfiability” problem to an algorithm with polynomial complexity

In the wake of the publication P! = NP (for which, by the way, a refutation has been published ), I want to share a link to an article by V.F. Romanov, in which he shows how it is possible to reduce the solution of the NP-complete “3-VYP” problem to a polynomial algorithm.

Let me remind you that any problem from the class NP can be "polynomially reduced" to any of the NP-complete problems . So if there is a polynomial algorithm for solving at least one problem, then potentially any NP-complete problem can also be solved by a polynomial algorithm.



Vladimir Fedorovich Romanov, professor at the ISIM department of Vladimir State University, has been trying for several years to publish his work in journals with a high level of authority, but reviewers simply do not want to take responsibility and publish this work, constantly motivating rejections with ridiculous nit-picking about formatting. For me, this looks ridiculous, because I have not met a more pedantic person than Professor Romanov.

At the moment, the article has been translated into English and I know that Vladimir Fedorovich is in correspondence with foreign magazines in order to publish it.

Here I publish a link to his work in the hope that it will get at least some resonance in the scientific community and they will pay attention to it.

Unorthodox combinatorial models
based on inconsistent structures
Romanov V.F. (romvf@mail.ru)
Vladimir State University

http://zhurnal.ape.relarn.ru/articles/2007/143.pdf

Update as of September 1

, 2010 Today I talked with Vladimir Fedorovich.

It turns out the English version of the article lies next to it:

Non-Orthodox combinatorial models based on discordant
structures
Romanov VF (romvf@mail.ru)
Vladimir state university

http://zhurnal.ape.relarn.ru/articles/2007/143e.pdf