A lower bound of 12n2 on linear search programs for the Knapsack problem
- 1 June 1978
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 16 (3), 413-417
- https://doi.org/10.1016/0022-0000(78)90026-0
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- 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