Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM

Tim Randolph, Karol Węgrzycki

We study the parameterized complexity of algorithmic problems whose input is an integer set $A$ in terms of the doubling constant $C:=|A+A|/|A|$, a fundamental measure of addit…