On Correlation of Р And NP Classes
Listrovoy Sergey Vladimirovich · International Journal of Modern Education and Computer Science · 2012
It is shown an incorrectness of introduction of a class of NP-complete problems, which reason is that Cook's S.А.theorem on that the "satisfiability" problem is the universal NP-complete problem, is not true and, therefore, the issue on existence of at least one NPcomplete problem remains open, that explains failures of attempts to estimate correlations between P and NP classes.