Polynomial-time Method of Determining Subset Sum Solutions
Data Structures and Algorithms
2017-05-16 v3
Abstract
Reducing the conditions under which a given set satisfies the stipulations of the subset sum proposition to a set of linear relationships, the question of whether a set satisfies subset sum may be answered in a polynomial number of steps by forming, solving, and constraining a series of linear systems whose dimensions and number are both polynomial with respect to the length of the set. Given its demonstrated 100% accuracy rate and its demonstrable justification, this algorithm may provide basis to reconsider the validity of SSP-based and NP-hard-reliant cryptosystems.
Cite
@article{arxiv.1412.5149,
title = {Polynomial-time Method of Determining Subset Sum Solutions},
author = {Aubrey Alston},
journal= {arXiv preprint arXiv:1412.5149},
year = {2017}
}
Comments
This version (now defunct) contains quite a few errors