Computer Science – Computational Complexity
Scientist
Computer Science
Computational Complexity
Scientist
Analysis of the Deterministic Polynomial Time Solvability of the 0-1-Knapsack Problem
Analysis of the postulates produced by Karp's Theorem
Independence of P vs. NP in regards to oracle relativizations
P is a proper subset of NP
No associations
LandOfFree
Jerrald Meek does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Jerrald Meek, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Jerrald Meek will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-227492