2 search results - page 1 / 1 » Computing pseudotriangulations via branched coverings |
CORR
2011
Springer
13 years 9 days ago
2011
Springer
CORR
2008
Springer
13 years 5 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 ...