A lower bound of 1/2n2 on linear search programs for the knapsack problem
- 1 January 1976
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- On some generalizations of binary searchPublished by Association for Computing Machinery (ACM) ,1974
- Proving simultaneous positivity of linear formsJournal of Computer and System Sciences, 1972
- Complete linear proofs of systems of linear inequalitiesJournal of Computer and System Sciences, 1972
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Computing the maximum and the medianPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1971