The Hardness of Speeding-up Knapsack
DOI:
https://doi.org/10.7146/brics.v5i14.19286Resumé
We show that it is not possible to speed-up the Knapsack problem efficiently in the parallel algebraic decision tree model. More specifically, we prove that any parallel algorithm in the fixed degree algebraic decision tree model that solves the decision version of the Knapsack problem requires Omega(sqrt(n)) rounds even by using 2^sqrt(n) processors. We extend the result to the PRAM model without bit-operations. These results are consistent with Mulmuley's recent result on the separation of the strongly-polynomial class and the corresponding NC class in the arithmetic PRAM model.Keywords lower-bounds, parallel algorithms, algebraic decision tree
Downloads
Publiceret
1998-01-14
Citation/Eksport
Sen, S. (1998). The Hardness of Speeding-up Knapsack. BRICS Report Series, 5(14). https://doi.org/10.7146/brics.v5i14.19286
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).