The bounded subset sum problem is almost everywhere randomly decidable in O(n)
From MaRDI portal
Publication:1083370
DOI10.1016/0020-0190(86)90123-7zbMath0604.90111MaRDI QIDQ1083370
H. Schreck, Gottfried Tinhofer
Publication date: 1986
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(86)90123-7
68Q25: Analysis of algorithms and problem complexity
90C27: Combinatorial optimization
90C09: Boolean programming
Related Items
An exact algorithm for the subset sum problem, The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem
Cites Work