On the existence of polynomial-time algorithms to the subset sum problem — mentioned by slackenerny

Sat, 21 Aug 2010 22:48:49 GMT

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 problems: http://arxiv.org/abs/0809.4935 (PNP), http://arxiv.org/abs/0806.2361 (RH)… at which point I have nothing more to say. Flagged.

Paper and discussion history. A mention is not an endorsement.

On the existence of polynomial-time algorithms to the subset sum problem · HackerPapers discussions

On the existence of polynomial-time algorithms to the subset sum problem — mentioned by slackenerny