Analysis of the postulates produced by Karp's Theorem

Details Analysis of the postulates produced by Karp's Theorem Analysis of the postulates produced by Karp's Theorem

2008-08-24

arxiv.org/abs/0808.3222v5

Computer Science

Computational Complexity

12 Pages; ftp://ftp%40micrognu%2Ecom:anon%40anon@ftp.micrognu.com/pnenp/conclusion.pdf

Scientific paper

This is the final article in a series of four articles. Richard Karp has proven that a deterministic polynomial time solution to K-SAT will result in a deterministic polynomial time solution to all NP-Complete problems. However, it is demonstrated that a deterministic polynomial time solution to any NP-Complete problem does not necessarily produce a deterministic polynomial time solution to all NP-Complete problems.

Affiliated with

Also associated with

No associations

Rating

Analysis of the postulates produced by Karp's Theorem 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 Analysis of the postulates produced by Karp's Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analysis of the postulates produced by Karp's Theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-535420