Conference Proceedings

On the parallel computation for the knapsack problem

Proceedings of the Annual ACM Symposium on Theory of Computing (1981) 123-127
DOI: 10.1145/800076.802465
11Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Yao, A. C. C. (1981). On the parallel computation for the knapsack problem. In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 123–127). Association for Computing Machinery. https://doi.org/10.1145/800076.802465

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free