A lower bound of 1 2n2 on linear search programs for the Knapsack problem

David Dobkin, Richard J. Lipton

Research output: Contribution to journalArticlepeer-review

46 Scopus citations

Fingerprint Dive into the research topics of 'A lower bound of 1 2n<sup>2</sup> on linear search programs for the Knapsack problem'. Together they form a unique fingerprint.

Mathematics