An Elegant Argument that P is not NP
Craig Alan Feinstein · arXiv (Cornell University) · 2006
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.