111
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We prove that the subset sum problem ax = x {0, 1}n (SUB) has a polynomial time computable certificate of infeasibility for all a with density at most 1/(2n), and for almost all ...