Computer Science – Computational Complexity
Scientific paper
2008-04-07
Computer Science
Computational Complexity
17 Pages; ftp://ftp%40micrognu%2ecom:anon%40anon@ftp.micrognu.com/pnenp/pnenp.pdf
Scientific paper
The purpose of this article is to examine and limit the conditions in which the P complexity class could be equivalent to the NP complexity class. Proof is provided by demonstrating that as the number of clauses in a NP-complete problem approaches infinity, the number of input sets processed per computation performed also approaches infinity when solved by a polynomial time solution. It is then possible to determine that the only deterministic optimization of a NP-complete problem that could prove P = NP would be one that examines no more than a polynomial number of input sets for a given problem. It is then shown that subdividing the set of all possible input sets into a representative polynomial search partition is a problem in the FEXP complexity class. The findings of this article are combined with the findings of other articles in this series of 4 articles. The final conclusion will be demonstrated that P =/= NP.
No associations
LandOfFree
P is a proper subset of 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 P is a proper subset of NP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and P is a proper subset of NP will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-729961