4 citations · 12 across the 4 of their papers we have counts for
4 papers
Analysis of the postulates produced by Karp's Theorem
Jerrald Meek
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 tim…
Independence of P vs. NP in regards to oracle relativizations
Jerrald Meek
This is the third article in a series of four articles dealing with the P vs. NP question. The purpose of this work is to demonstrate that the methods used in the first two article…
Analysis of the Deterministic Polynomial Time Solvability of the 0-1-Knapsack Problem
Jerrald Meek
Previously the author has demonstrated that a representative polynomial search partition is required to solve a NP-complete problem in deterministic polynomial time. It has also be…
P is a proper subset of NP
Jerrald Meek
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 demonstratin…