首页    期刊浏览 2024年11月05日 星期二
登录注册

文章基本信息

  • 标题:The Hardness of Speeding-up Knapsack
  • 本地全文:下载
  • 作者:Sandeep Sen
  • 期刊名称:BRICS Report Series
  • 印刷版ISSN:0909-0878
  • 出版年度:1998
  • 卷号:5
  • 期号:14
  • 出版社:Aarhus University
  • 摘要: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
国家哲学社会科学文献中心版权所有