research
∙
05/17/2022
Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution
We present new exact and approximation algorithms for 0-1-Knapsack and U...
share
research
∙
07/15/2021
Sparse Fourier Transform by traversing Cooley-Tukey FFT computation graphs
Computing the dominant Fourier coefficients of a vector is a common task...
research
∙
08/24/2020
Fast and Simple Modular Subset Sum
We revisit the Subset Sum problem over the finite cyclic group ℤ_m for s...
research
∙
12/28/2019
Approximating Subset Sum is equivalent to Min-Plus-Convolution
Approximating Subset Sum is a classic and fundamental problem in compute...
research
∙
05/22/2018
More Consequences of Falsifying SETH and the Orthogonal Vectors Conjecture
The Strong Exponential Time Hypothesis and the OV-conjecture are two pop...
research
∙
03/02/2018
