A Parallel Algorithm for the Knapsack Problem

DOI10.1109/TC.1984.1676456zbMath0528.68028MaRDI QIDQ3309063

Ehud D. Karnin

Publication date: 1984

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

zbMATH Keywords

cryptographyknapsack problemparallel architectureVLSI complexitytime-memory- processor tradeoff

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Theory of operating systems (68N25)

Related Items (2)

An efficient pruning algorithm for value independent knapsack problem using a DAG structure ⋮ An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem

This page was built for publication: A Parallel Algorithm for the Knapsack Problem