2000 character limit reached
On the relationship between classes P and NP
Published 26 Sep 2011 in cs.DM and cs.CC | (1109.5531v1)
Abstract: In this paper we discusses 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. As we will shown in the paper, these difficulties are exactly in the formulation of some problems of the class NP.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.