A low-space algorithm for the subset-sum problem on GPU (Q1652299): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3241581 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving knapsack problems on GPU / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4821303 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3993418 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel time and space upper-bounds for the subset-sum problem / rank | |||
Normal rank |
Latest revision as of 03:11, 16 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A low-space algorithm for the subset-sum problem on GPU |
scientific article |
Statements
A low-space algorithm for the subset-sum problem on GPU (English)
0 references
11 July 2018
0 references
subset-sum problem
0 references
parallel algorithm
0 references
GPU
0 references
0 references