On the Relationship between Classes P and NP
Anatoly D. Plotnikov
DOI : 10.3844/jcssp.2012.1036.1040
Journal of Computer Science
Volume 8, Issue 7
Problem statement: In this study we discuss the relationship between the known classes P and NP. We show that the difficulties in solving problem P versus NP have methodological in nature. An algorithm for solving any problem is sensitive to even small changes in its formulation. Conclusion/Recommendations: As we will show in the study, these difficulties are exactly in the formulation of some problems of the class NP. We construct a class UF that contains P and that simultaneously is strictly contained in NP. Therefore, a new problem arises P versus UF."
Cite this Article
Plotnikov, A.D., 2012. On the relationship between classes P and NP. J. Comput. Sci., 8: 1036-1040.