@inproceedings{a27c7de78b354ff4881fbdf36825e21d,

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

author = "David Dobkin and Lipton, {Richard J.}",

note = "Funding Information: *Portions of this research were supported by the Office of Naval Research under grant N00014-75-C-0450 to the first author and the National Science Foundation under grant DCR-74-12870 to the second author.; 5th Symposium on Mathematical Foundations of Computer Science, MFCS 1976 ; Conference date: 06-09-1976 Through 10-09-1976",

year = "1976",

doi = "10.1007/3-540-07854-1_185",

language = "English (US)",

isbn = "9783540078548",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "265--269",

editor = "Antoni Mazurkiewicz",

booktitle = "Mathematical Foundations of Computer Science 1976 - Proceedings, 5th Symposium",

address = "Germany",

}