Q3774941
type: Item
instance of: scholarly article
zbMATH Open document ID: 0635.68031
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 4035132
zbMATH Keywords: knapsack problem
zbMATH Keywords: subset sum problem
zbMATH Keywords: parallel algorithm
zbMATH Keywords: parallel random access machine
MaRDI profile type: Publication
Recommended article: Parallel time and space upper-bounds for the subset-sum problem
Recommended article: An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
Recommended article: Parallel approximation schemes for subset sum and knapsack problems
Recommended article: A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum
Recommended article: A parallel algorithm for subset selection
Recommended article: A parallel algorithm of complexity O(log 2 n) for the set balancing problem
Recommended article: A fast bit-parallel algorithm for computing the subset partial order
Recommended article: Q3363859
Recommended article: Fast parallel algorithms for the maximum sum problem
description: scientific article