David P. Dobkin, Richard J. Lipton. A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem. In Antoni W. Mazurkiewicz, editor, Mathematical Foundations of Computer Science 1976, 5th Symposium, Gdansk, Poland, September 6-10, 1976, Proceedings. Volume 45 of Lecture Notes in Computer Science, pages 265-269, Springer, 1976.
@inproceedings{DobkinL76:0,
title = {A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem},
author = {David P. Dobkin and Richard J. Lipton},
year = {1976},
tags = {search},
researchr = {https://researchr.org/publication/DobkinL76%3A0},
cites = {0},
citedby = {0},
pages = {265-269},
booktitle = {Mathematical Foundations of Computer Science 1976, 5th Symposium, Gdansk, Poland, September 6-10, 1976, Proceedings},
editor = {Antoni W. Mazurkiewicz},
volume = {45},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
}