On Parallel Computation for the Knapsack Problem

DOI10.1145/322326.322342zbMath0483.68039OpenAlexW2052394037MaRDI QIDQ3942393

Andrew Chi-Chih Yao

Publication date: 1982

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322326.322342

zbMATH Keywords

branching operationstime-processor trade-off constraint

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Theory of operating systems (68N25)

Related Items

A size-depth trade-off for the analog computation of Boolean functions ⋮ Decision tree complexity and Betti numbers