A parallel O(n27n/8) time-memory-processor tradeoff for Knapsack-like problems

Authors:
Ken-Li Li;Ren-Fa Li;Yang Lei;Yan-Tao Zhou
Affiliations:
School of Computer and Communication, Hunan University, Changsha, China;School of Computer and Communication, Hunan University, Changsha, China;School of Computer and Communication, Hunan University, Changsha, China;School of Computer and Communication, Hunan University, Changsha, China
Venue:
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
Year:
2005

Citing 7
Cited 0

A Parallel Time/Hardware Tradeoff T.H=O(2/sup n/2/) for the Knapsack Problem

IEEE Transactions on Computers
A parallel algorithm for the knapsack problem using a generation and searching technique

Parallel Computing
A parallel two-list algorithm for the knapsack problem

Parallel Computing
Computing Partitions with Applications to the Knapsack Problem

Journal of the ACM (JACM)
Comments on parallel algorithms for the knapsack problem

Parallel Computing
Optimal parallel algorithm for the knapsack problem without memory conflicts

Journal of Computer Science and Technology
A Parallel Algorithm for the Knapsack Problem

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

A general-purpose parallel three-list four-table algorithm that can solve a number of knapsack-like NP-complete problems is developed in this paper. Running on an EREW PRAM model, The proposed parallel algorithm can solve this kind of problems of size n in O(n29n/20) time, with O(213n/40) shared memory units and O(2n/10) processors, and thus its time-space-processor tradeoff is O(n2 7n/8). The performance analysis and comparisons show that the proposed algorithms are both time and space efficient, and thus is an improved result over the past researches. Since it can break greater variables knapsack-based cryptosystems and watermark, the new algorithm has some cryptanalytic significance.