On the parameterized complexity of k-SUM

In the k-SUM problem, we are given a set of numbers and asked if there are k of them which sum to 0. The case of k = 3 has been extensively studied in computational geometry, and known to be intimately related to many low-dimensional problems. The case of arbitrary k is the natural parameterization of Subset Sum and is well-known in parameterized algorithms and complexity. We present new FPT reductions between the k-SUM problem and the k-Clique problem, yielding several complexity-theoretic and algorithmic consequences. Our reductions show that k-SUM on “small” numbers (in the range [−n f(k) ,n f(k) ] for any computable function f) is W[1]complete, and that k-SUM (in general) is W[1]-complete under a common derandomization assumption. These results effectively resolve the parameterized complexity of k-SUM, initially posed in 1992 by Downey and Fellows in their seminal paper on parameterized intractability [11, 12]. Our method is quite general and applies to other weighted problems as well.

[1]  Svatopluk Poljak,et al.  On the complexity of the subgraph problem , 1985 .

[2]  Mihai Patrascu,et al.  On the possibility of faster SAT algorithms , 2010, SODA '10.

[3]  Aravind Srinivasan,et al.  Splitters and near-optimal derandomization , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[4]  F. Behrend.  On Sets of Integers Which Contain No Three Terms in Arithmetical Progression. , 1946, Proceedings of the National Academy of Sciences of the United States of America.

[5]  Jonathan F. Buss,et al.  Algorithms in the W-Hierarchy , 2007, Theory of Computing Systems.

[6]  Andrzej Lingas,et al.  Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication , 2009, SIAM J. Comput..

[7]  Yijia Chen,et al.  Machine-based methods in parameterized complexity theory , 2005, Theor. Comput. Sci..

[8]  Mark H. Overmars,et al.  On a Class of O(n2) Problems in Computational Geometry , 1995, Comput. Geom..

[9]  Mam Riess Jones.  Color Coding , 1962, Human factors.

[10]  Ryan Williams,et al.  Finding, minimizing, and counting weighted subgraphs , 2009, STOC '09.

[11]  Dieter van Melkebeek,et al.  Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses , 1999, STOC '99.

[12]  Amir Abboud,et al.  Exact Weight Subgraphs and the k-Sum Conjecture , 2013, ICALP.

[13]  Sariel Har-Peled,et al.  Polygon-containment and translational min-Hausdorff-distance between segment sets are 3SUM-hard , 2001, SODA '99.

[14]  Erik D. Demaine,et al.  Subquadratic Algorithms for 3SUM , 2005, Algorithmica.

[15]  Robert E. Tarjan,et al.  Finding a Maximum Independent Set , 1976, SIAM J. Comput..

[16]  Jeff Erickson,et al.  Lower bounds for linear satisfiability problems , 1995, SODA '95.

[17]  Kevin O'Bryant,et al.  Sets of Integers that do not Contain Long Arithmetic Progressions , 2008, Electron. J. Comb..

[18]  Mihai Patrascu,et al.  Towards polynomial lower bounds for dynamic problems , 2010, STOC '10.

[19]  Antonio Hernández-Barrera,et al.  Finding an o(n2 log n) Algorithm Is Sometimes Hard , 1996, Canadian Conference on Computational Geometry.

[20]  Simon Perdrix,et al.  The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes , 2012, TAMC.

[21]  Michael R. Fellows,et al.  Fixed-parameter intractability , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[22]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[23]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[24]  David P. Woodruff,et al.  The Complexity of Linear Dependence Problems in Vector Spaces , 2011, ICS.