Computer Science – Computational Complexity
Scientific paper
2006-07-19
Progress in Physics Volume 2 (2011), 30-31
Computer Science
Computational Complexity
2 pages; Version 14 is the published version, but this version is clearer
Scientific paper
In this note, we present an elegant argument that P is not NP by
demonstrating that the Meet-in-the-Middle algorithm must have the fastest
running-time of all deterministic and exact algorithms which solve the
SUBSET-SUM problem on a classical computer.
No associations
LandOfFree
An Elegant Argument that P is not NP 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 An Elegant Argument that P is not NP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Elegant Argument that P is not NP will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-624634