10 citations · 12 across the 2 of their papers we have counts for
2 papers
cs.CC2013★ 2 cited
Losing Weight by Gaining Edges
Amir Abboud, Kevin Lewi, Ryan Williams
We present a new way to encode weighted sums into unweighted pairwise constraints, obtaining the following results. - Define the k-SUM problem to be: given n integers in [-n^2k, n^…
cs.DS2013★ 10 cited
Exact Weight Subgraphs and the k-Sum Conjecture
Amir Abboud, Kevin Lewi
We consider the Exact-Weight-H problem of finding a (not necessarily induced) subgraph H of weight 0 in an edge-weighted graph G. We show that for every H, the complexity of this p…