A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem - researchr publication

researchr

You are not signed in
Sign in
Sign up

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.

Abstract is missing.

runs on WebDSL