A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Polynomial-time Matrix-based Method of Determining Subset Sum Solutions

2020

The subset sum problem is a well-known member of the NP- complete complexity class: given a set of integers A and some constant c, is there some subset of A which sums to c? There have been no known algorithms or methods to solve the value-unbounded, general-case subset sum problem in polynomial time. A naive algorithm performs in exponential time by cycling through the possible subsets of A until it has either seen all subsets or found one that sums to c. A common pseudo-polynomial algorithm

doi:10.7916/cusj.v9i0.5634
fatcat:2ekyz5e7ozgrfmx53mu4au4slm