Parameterized Complexity and Subexponential-Time Computability

Since its inception in the 1990's, parameterized complexity has established itself as one of the major research areas in theoretical computer science. Parameterized and kernelization algorithms have proved to be very useful for solving important problems in various domains of science and technology. Moreover, parameterized complexity has shown deep connections to traditional areas of theoretical computer science, such as structural complexity theory and approximation algorithms. In this paper, we discuss some of the recent results pertaining to the relation between parameterized complexity and subexponential-time computability. We focus our attention on satisfiability problems because they play a key role in the definition of both parameterized complexity and structural complexity classes, and because they model numerous important problems in computer science.

[1]  Dániel Marx,et al.  Parameterized Complexity and Approximation Algorithms , 2008, Comput. J..

[2]  Yijia Chen,et al.  On miniaturized problems in parameterized complexity theory , 2006, Theor. Comput. Sci..

[3]  Ge Xia,et al.  Strong computational lower bounds via parameterized complexity , 2006, J. Comput. Syst. Sci..

[4]  Dániel Marx,et al.  Slightly superexponential parameterized problems , 2011, SODA '11.

[5]  Russell Impagliazzo,et al.  Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..

[6]  Ryan Williams.  Nonuniform ACC Circuit Lower Bounds , 2014, JACM.

[7]  Ge Xia,et al.  Polynomial time approximation schemes and parameterized complexity , 2007, Discret. Appl. Math..

[8]  Andreas Björklund,et al.  Determinant Sums for Undirected Hamiltonicity , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[9]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[10]  Russell Impagliazzo,et al.  A duality between clause width and clause density for SAT , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[11]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues , 1995, Ann. Pure Appl. Log..

[12]  Yijia Chen,et al.  An Isomorphism Between Subexponential and Parameterized Complexity Theory , 2007, SIAM J. Comput..

[13]  Robin Milner.  An Action Structure for Synchronous pi-Calculus , 1993, FCT.

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

[15]  Ge Xia,et al.  On parameterized exponential time complexity , 2009, Theor. Comput. Sci..

[16]  Liming Cai,et al.  Circuit Bottom Fan-In and Computational Power , 1998, SIAM J. Comput..

[17]  Jianer Chen.  Characterizing Parallel Hierarchies by Reducibilities , 1991, Inf. Process. Lett..

[18]  Yijia Chen,et al.  Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping , 2007, CSL.

[19]  Ioannis Koutis,et al.  Faster Algebraic Algorithms for Path and Packing Problems , 2008, ICALP.

[20]  Liming Cai,et al.  The Complexity of Polynomial-Time Approximation , 2007, Theory of Computing Systems.

[21]  Weijia Jia,et al.  Vertex Cover: Further Observations and Further Improvements , 2001, J. Algorithms.

[22]  J. Håstad.  Computational limitations of small-depth circuits , 1987 .

[23]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[24]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[25]  Liming Cai,et al.  On the existence of subexponential parameterized algorithms , 2003, J. Comput. Syst. Sci..

[26]  Fenghui Zhang,et al.  Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms , 2009 .

[27]  Jörg Flum,et al.  Parametrized Complexity and Subexponential Time (Column: Computational Complexity) , 2004, Bull. EATCS.

[28]  B. Monien.  How to Find Long Paths Efficiently , 1985 .

[29]  Noga Alon,et al.  Color-coding , 1995, JACM.

[30]  Rolf Niedermeier,et al.  On Exact and Approximation Algorithms for Distinguishing Substring Selection , 2003, FCT.

[31]  Walter Kern,et al.  An improved deterministic local search algorithm for 3-SAT , 2004, Theor. Comput. Sci..

[32]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[33]  Michael R. Fellows,et al.  Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems , 2003, CATS.

[34]  Yijia Chen,et al.  Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping , 2009, J. Log. Comput..

[35]  Ryan Williams,et al.  Finding paths of length k in O*(2k) time , 2008, Inf. Process. Lett..

[36]  John Michael Robson,et al.  Algorithms for Maximum Independent Sets , 1986, J. Algorithms.

[37]  Ge Xia,et al.  Tight lower bounds for certain parameterized NP-hard problems , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[38]  Gerhard J. Woeginger,et al.  Exact Algorithms for NP-Hard Problems: A Survey , 2001, Combinatorial Optimization.

[39]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[40]  Russell Impagliazzo,et al.  On the Complexity of k-SAT , 2001, J. Comput. Syst. Sci..

[41]  Bin Ma,et al.  Genetic Design of Drugs Without Side-Effects , 2003, SIAM J. Comput..

[42]  Ryan Williams,et al.  Non-uniform ACC Circuit Lower Bounds , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

[43]  Liming Cai,et al.  On the Amount of Nondeterminism and the Power of Verifying , 1997, SIAM J. Comput..

[44]  Jianer Chen,et al.  Improved deterministic algorithms for weighted matching and packing problems , 2011, Theor. Comput. Sci..

[45]  Rolf Niedermeier,et al.  Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems , 2003, Algorithmica.

[46]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

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