A low-space algorithm for the subset-sum problem on GPU (Q1652299): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2017.02.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2588454908
@@ Property / OpenAlex ID: W2588454908 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3241581
@@ Property / cites work: Q3241581 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving knapsack problems on GPU
@@ Property / cites work: Solving knapsack problems on GPU / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Partitions with Applications to the Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
+Normal rank
@@ Property / cites work @@
+Parallel time and space upper-bounds for the subset-sum problem
+Normal rank