A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem.

David P. Dobkin, Richard J. Lipton

Browse the full MFCS paper archive.