On the existence of polynomial-time algorithms to the subset sum problem
Jorma Jormakka
Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.
Abstract
This paper proves that there does not exist a polynomial-time algorithm to the the subset sum problem. As this problem is in NP, the result implies that the class P of problems admitting polynomial-time algorithms does not equal the class NP of problems admitting nondeterministic polynomial-time algorithms.
arXiv comments
The paper proves that P is not NP. This is a checked and revised version of the 2008 preprint. The paper is still correct and still unchecked. I did try to submit it to one journal two weeks ago, but as often happens on this particular field of mathematics, the journal editor did not take a proof of P not NP to a review. It was reviewed for 15 weeks in 2008 and no error was found at that time
I spent half an hour composing meaningful description of insignificance of the work (without judging if it is indeed a result, attacked "uniqueness" is more of a technicality than anything much of a big deal) only to find out author also published stabs at some other Clay…
I spent half an hour composing meaningful description of insignificance of the work (without judging if it is indeed a result, attacked "uniqueness" is more of a technicality than anything much of a big deal) only to find out author also published stabs at some other Clay…
slackenernyView on HNParent context