scientific article

zbMATH Open0635.68031MaRDI QIDQ3774941

Author name not available (Why is that?)

Publication date: 1986

Title of this publication is not available (Why is that?)

zbMATH Keywords

knapsack problemparallel algorithmsubset sum problemparallel random access machine

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Related Items (1)

A low-space algorithm for the subset-sum problem on GPU

Recommendations

• Title not available (Why is that?) 👍 👎
• Fast parallel algorithms for the maximum sum problem 👍 👎
• An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem 👍 👎
• Parallel time and space upper-bounds for the subset-sum problem 👍 👎
• Parallel approximation schemes for subset sum and knapsack problems 👍 👎
• A fast bit-parallel algorithm for computing the subset partial order 👍 👎
• A parallel algorithm of complexity O(log 2 n) for the set balancing problem 👍 👎
• A parallel algorithm for subset selection 👍 👎
• A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3774941)