Analysis of the postulates produced by Karp's Theorem
Computational Complexity
2008-09-03 v5
Abstract
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.
Cite
@article{arxiv.0808.3222,
title = {Analysis of the postulates produced by Karp's Theorem},
author = {Jerrald Meek},
journal= {arXiv preprint arXiv:0808.3222},
year = {2008}
}
Comments
12 Pages; ftp://ftp%40micrognu%2Ecom:anon%40anon@ftp.micrognu.com/pnenp/conclusion.pdf