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

Details On the existence of polynomial-time algorithms to the subset sum problem On the existence of polynomial-time algorithms to the subset sum problem

2008-09-29

arxiv.org/abs/0809.4935v3

Mathematics

General Mathematics

Proof of P!=NP. Paper restructured into small lemmas. Has been reviewed over 15 months, still believed to be correct

Scientific paper

The paper present a way to show that the subset sum problem cannot be solved
in polynomial time.

Affiliated with

Also associated with

No associations

Rating

On the existence of polynomial-time algorithms to the subset sum problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the existence of polynomial-time algorithms to the subset sum problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the existence of polynomial-time algorithms to the subset sum problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-49067