Since 2014
The Hardness of Speeding-up Knapsack
BRICS Report Series
View Archive Info| Field | Value | |
| Title |
The Hardness of Speeding-up Knapsack
|
|
| Creator |
Sen, Sandeep
|
|
| Description |
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
|
|
| Publisher |
Aarhus University
|
|
| Contributor |
—
|
|
| Date |
1998-01-14
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion — |
|
| Format |
application/pdf
|
|
| Identifier |
https://tidsskrift.dk/brics/article/view/19286
10.7146/brics.v5i14.19286 |
|
| Source |
BRICS Report Series; No 14 (1998): RS-14 The Hardness of Speeding-up Knapsack
BRICS Report Series; No 14 (1998): RS-14 The Hardness of Speeding-up Knapsack 1601-5355 0909-0878 |
|
| Language |
eng
|
|
| Relation |
https://tidsskrift.dk/brics/article/view/19286/16913
|
|
| Rights |
Copyright (c) 2014 BRICS Report Series
|
|