On the relationship between classes P and NP
Discrete Mathematics
2016-03-03 v1 Computational Complexity
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.
Keywords
Cite
@article{arxiv.1109.5531,
title = {On the relationship between classes P and NP},
author = {Anatoly D. Plotnikov},
journal= {arXiv preprint arXiv:1109.5531},
year = {2016}
}
Comments
9 pages