A lower time bound for the knapsack problem on random access machines

• 1 September 1983
• journal article
• Published by Springer Nature in Acta Informatica
• Vol. 19  (4) , 385-395
• https://doi.org/10.1007/bf00290735

Abstract

Keywords

• TIME BOUND
• DECISION TREE
• KNAPSACK PROBLEM
• ACCESS MACHINES
• METHOD DUE
• LOWER TIME
• RANDOM ACCESS