Answers are grounded in this paper and cite their sources.
The complexity of solwng the knapsack problem with n input real numbers on a parallel computer wRh real arithmeUc and branching operations is considered A trine-processor trade-off constraint ts derived; m particular, it ts shown that an exponential number of processors have to be used if the problem is to be solved m time t _< ~n/2.
No takes yet. Share an insight, caveat, or question.
Andrew Chi-Chih Yao (1982) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: