Computer Science – Discrete Mathematics
Scientific paper
2011-09-26
Computer Science
Discrete Mathematics
9 pages
Scientific paper
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.
No associations
LandOfFree
On the relationship between classes P and NP does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the relationship between classes P and NP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the relationship between classes P and NP will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-689050