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

David Dobkin, Richard J. Lipton

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations
Original languageEnglish (US)
Title of host publicationMathematical Foundations of Computer Science 1976 - Proceedings, 5th Symposium
EditorsAntoni Mazurkiewicz
PublisherSpringer Verlag
Pages265-269
Number of pages5
ISBN (Print)9783540078548
DOIs
StatePublished - Jan 1 1976
Externally publishedYes
Event5th Symposium on Mathematical Foundations of Computer Science, MFCS 1976 - Gdansk, Poland
Duration: Sep 6 1976Sep 10 1976

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume45 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th Symposium on Mathematical Foundations of Computer Science, MFCS 1976
CountryPoland
CityGdansk
Period9/6/769/10/76

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

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.

  • Cite this

    Dobkin, D., & Lipton, R. J. (1976). A lower bound of 1/2n2 on linear search programs for the knapsack problem. In A. Mazurkiewicz (Ed.), Mathematical Foundations of Computer Science 1976 - Proceedings, 5th Symposium (pp. 265-269). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 45 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-07854-1_185