An alternative to Ben-Or s lower bound for the knapsack problem complexity

Valentin E. Brimkov, Stefan S. Dantchev. An alternative to Ben-Or s lower bound for the knapsack problem complexity. Appl. Math. Lett., 15(2):187-191, 2002. [doi]

Abstract

Abstract is missing.