Hardness of Approximation for Knapsack Problems

2015

Theory of Computing Systems , Volume 56 - Issue 2 p. 372- 393

Additional Metadata
Keywords	Computational complexity, Knapsack problem, Subset-sum, Exponential-time hypothesis, PRAM without bit operations, Algebraic-circuit lower-bounds, Hardness of operations
THEME	Information (theme 2)
Publisher	Springer
Persistent URL	doi.org/10.1007/s00224-014-9550-z
Journal	Theory of Computing Systems
Project	Networks
Grant	This work was funded by the The Netherlands Organisation for Scientific Research (NWO); grant id nwo/024.002.003 - Networks
Organisation	Algorithms and Complexity
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Buhrman, H., Loff Barreto, B. S., & Torenvliet, L. (2015). Hardness of Approximation for Knapsack Problems. Theory of Computing Systems, 56(2), 372–393. doi:10.1007/s00224-014-9550-z

Publication