On Parallel Computation for the Knapsack Problem
Author:
Open Access
- 1 July 1982
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 29 (3) , 898-903
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Lower bounds for algebraic decision treesJournal of Algorithms, 1982
- Hardware complexity and parallel computation1980
- A lower bound of 12n2 on linear search programs for the Knapsack problemJournal of Computer and System Sciences, 1978
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977