Page
%P
![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
A Parallel O(n27n/8) Time-Memory-Processor Tradeoff for Knapsack-Like Problems
A general-purpose parallel three-list four-table algorithm that can solve a number of knapsack-like NP-complete problems is developed in this paper. Running on an EREW PRAM model, The proposed parallel algorit...