Computer Science – Computational Complexity
Scientific paper
2005-11-25
Computer Science
Computational Complexity
9 pages ; 3 figures
Scientific paper
The open question, P=NP?, was presented by Cook (1971). In this paper, a
proof that P is not equal to NP is presented. In addition, it is shown that P
is not equal to the intersection of NP and co-NP. Finally, the exact inclusion
relationships between the classes P, NP and co-NP are presented.
No associations
LandOfFree
Proving that P is not equal to NP and that P is not equal to the intersection of NP and co-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 Proving that P is not equal to NP and that P is not equal to the intersection of NP and co-NP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proving that P is not equal to NP and that P is not equal to the intersection of NP and co-NP will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-435430