An Elegant Argument that P is not NP
Computational Complexity
2011-10-11 v9
Abstract
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.
Cite
@article{arxiv.cs/0607093,
title = {An Elegant Argument that P is not NP},
author = {Craig Alan Feinstein},
journal= {arXiv preprint arXiv:cs/0607093},
year = {2011}
}
Comments
2 pages; Version 14 is the published version, but this version is clearer