Year: 2011
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Plotnikov, Anatoly D.
Institution: Volodymyr Dahl East Ukrainian National University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2950500098