Analysis of the postulates produced by Karp's Theorem

Simple item page
dc.creatorMeek, Jerrald
dc.date2008-08-24
dc.date2008-09-03
dc.date.accessioned2026-07-07T09:59:53Z
dc.date.available2026-07-07T09:59:53Z
dc.descriptionThis 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.
dc.description12 Pages; ftp://ftp%40micrognu%2Ecom:anon%40anon@ftp.micrognu.com/pnenp/conclusion.pdf
dc.identifierhttps://arxiv.org/abs/0808.3222
dc.identifierhttp://arxiv.org/abs/0808.3222
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/168188
dc.subjectComputational Complexity
dc.subjectF.2.0
dc.titleAnalysis of the postulates produced by Karp's Theorem
dc.typetext

Files

Collections

arXiv