An Elegant Argument that P is not NP
<|reference_start|>An Elegant Argument that P is not NP: 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.<|reference_end|>
@article{feinstein2006an,
    title={An Elegant Argument that P is not NP},
    author={Craig Alan Feinstein},
    journal={Progress in Physics Volume 2 (2011), 30-31},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0607093},
    primaryClass={cs.CC}
}