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

David P. Dobkin, Richard J. Lipton. A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem. J. Comput. Syst. Sci., 16(3):413-417, 1978.

Abstract

Abstract is missing.