On the Relationship between Classes P and NP | Science Publications

Journal of Computer Science

Anatoly D. Plotnikov¹ 

关键词: Class P;    class NP;    class UF;    set-theoretic model;    problem without foresight;    problem that exponential in nature;   

DOI  :  10.3844/jcssp.2012.1036.1040

学科分类：计算机科学（综合）

来源: Science Publications

【 摘 要 】

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”."

【 授权许可】

Unknown