On the parallel computation for the knapsack problem

  • Authors:

  • Andrew C Yao

  • Affiliations:

  • -

  • Venue:
  • On the parallel computation for the knapsack problem
  • Year:
  • 1980

Quantified Score

Hi-index 0.00

Visualization

Abstract

We are interested in the complexity of solving the knapsack problem with n input real numbers on a parallel computer with real arithmetic and branching operations. A processor-time tradeoff constraint is derived; in particular, it is shown that an exponential number of processors have to be used if the problem is to be solved in time $t \le {\sqrt{n}}/2$.