Evidence that P ≠ Np

The question of whether the class of decision problems that can be solved by deterministic polynomial-time algorithms, P , is equal to the class of decision problems that can be solved by nondeterministic polynomial-time algorithms, NP , has been open since it was first formulated by Cook, Karp, and Levin in 1971. In this paper, we give evidence that they are not equal by examining the SUBSET-SUM problem.Disclaimer: This article was authored by Craig Alan Feinstein in his private capacity. No official support or endorsement by the U.S. Government is intended or should be inferred