On the parallel computation for the knapsack problem

Authors:
Andrew Chi-Chih Yao
Affiliations:
-
Venue:
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Year:
1981

Citing 1
Cited 2

The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem

Journal of the ACM (JACM)
A polynomial linear search algorithm for the n-dimensional knapsack problem

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

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 ≤ @@@@n/2.