Dense Subset Sum may be the hardest

Per Austrin, Mikko Koivisto, Petteri Kaski, Jesper Nederlof

Type: Preprint

Publication Date: 2015-08-25

Citations: 1

Locations

arXiv (Cornell University) - View

Similar Works

Action	Title	Year	Authors
+	Dense Subset Sum may be the hardest	2015	Per Austrin Mikko Koivisto Petteri Kaski Jesper Nederlof
+	On Near-Linear-Time Algorithms for Dense Subset Sum	2020	Karl Bringmann Philip Wellnitz
+	On Near-Linear-Time Algorithms for Dense Subset Sum	2020	Karl Bringmann Philip Wellnitz
+ PDF Chat	On Near-Linear-Time Algorithms for Dense Subset Sum	2021	Karl Bringmann Philip Wellnitz
+	Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors	2020	Jesper Nederlof Karol Węgrzycki
+	Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors	2020	Jesper Nederlof Karol Węgrzycki
+	Fast Low-Space Algorithms for Subset Sum	2020	Ce Jin Nikhil Vyas Ryan Williams
+ PDF Chat	Approximating Subset Sum Ratio via Subset Sum Computations	2022	Giannis Alonistiotis Antonis Antonopoulos Nikolaos Melissinos Aris Pagourtzis Stavros Petsalakis Manolis Vasilakis
+	Equal-subset-sum faster than the meet-in-the-middle	2019	Marcin Mucha Jesper Nederlof Jakub Pawlewicz Karol Węgrzycki
+	On the Hardness of Almost All Subset Sum Problems by Ordinary Branch-and-Bound	2020	Mustafa Kemal Tural
+	Equal-Subset-Sum Faster Than the Meet-in-the-Middle	2019	Marcin Mucha Jesper Nederlof Jakub Pawlewicz Karol Węgrzycki
+	Equal-Subset-Sum Faster Than the Meet-in-the-Middle	2019	Marcin Mucha Jesper Nederlof Jakub Pawlewicz Karol Węgrzycki
+ PDF Chat	Fast Low-Space Algorithms for Subset Sum	2021	Ce Jin Nikhil Vyas Ryan Williams
+	A Probabilistic Approach to The Perfect Sum Problem	2022	Kristof Pusztai
+	Approximating Sumset Size	2021	Anindya De Shivam Nadimpalli Rocco A. Servedio
+	Approximating Subset Sum Ratio via Partition Computations	2022	Giannis Alonistiotis Antonis Antonopoulos Nikolaos Melissinos Aris Pagourtzis Stavros Petsalakis Manolis Vasilakis
+	Subset sums, completeness and colorings	2021	David Conlon Jacob Fox Huy Tuan Pham
+ PDF Chat	Sumsets as unions of sumsets of subsets	2018	Jordan S. Ellenberg
+ PDF Chat	Beating Bellman's Algorithm for Subset Sum	2024	Karl Bringmann Nick Fischer Vasileios Nakos
+	Top-k-Convolution and the Quest for Near-Linear Output-Sensitive Subset Sum	2021	Karl Bringmann Vasileios Nakos

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (0)

Action	Title	Year	Authors