Parameterized Random Complexity

The classes W[P] and W[1] are parameterized analogues of NP in that they can be characterized by machines with restricted existential nondeterminism. These machine characterizations give rise to two natural notions of parameterized randomized algorithms that we call W[P]-randomization and W[1]-randomization. This paper develops the corresponding theory.

[1]  Martin Grohe.  Generalized Model-Checking Problems for First-Order Logic , 2001, STACS.

[2]  Moritz Müller.  Randomized Approximations of Parameterized Counting Problems , 2006, IWPEC.

[3]  Moritz Müller.  Valiant-Vazirani Lemmata for Various Logics , 2008, Electron. Colloquium Comput. Complex..

[4]  Avi Wigderson,et al.  Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[5]  Jianer Chen,et al.  Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms , 2006, IWPEC.

[6]  Richard Chang,et al.  On Unique Satisfiability and the Threshold Behavior of Randomized Reductions , 1995, J. Comput. Syst. Sci..

[7]  Avi Wigderson,et al.  Pairwise Independence and Derandomization , 2006, Found. Trends Theor. Comput. Sci..

[8]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[9]  Michael R. Fellows,et al.  Fixed-Parameter Complexity and Cryptography , 1993, AAECC.

[10]  Oded Goldreich,et al.  Computational complexity - a conceptual perspective , 2008 .

[11]  Larry J. Stockmeyer,et al.  On Approximation Algorithms for #P , 1985, SIAM J. Comput..

[12]  Russell Impagliazzo,et al.  The complexity of unique k-SAT: an isolation lemma for k-CNFs , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[13]  J. Andrés Montoya.  The parameterized complexity of probability amplification , 2008, Inf. Process. Lett..

[14]  Moritz Müller.  Parameterized Derandomization , 2008, IWPEC.

[15]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[16]  Mark Jerrum.  Sampling and counting , 2003 .

[17]  Jianer Chen,et al.  Improved algorithms for path, matching, and packing problems , 2007, SODA '07.

[18]  Liming Cai,et al.  On the Structure of Parameterized Problems in NP , 1995, Inf. Comput..

[19]  J. Andrés Montoya.  On the parameterized complexity of approximate counting , 2011, RAIRO Theor. Informatics Appl..

[20]  Leizhen Cai,et al.  Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems , 2006, IWPEC.

[21]  Jörg Flum,et al.  Model-checking problems as a basis for parameterized intractability , 2004, LICS 2004.

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

[23]  Stephen A. Cook,et al.  Time-bounded random access machines , 1972, J. Comput. Syst. Sci..

[24]  Richard P. Brent,et al.  The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.

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

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

[27]  Yijia Chen,et al.  Bounded nondeterminism and alternation in parameterized complexity theory , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[28]  Yijia Chen,et al.  The parameterized complexity of maximality and minimality problems , 2008, Ann. Pure Appl. Log..

[29]  János Komlós,et al.  Deterministic simulation in LOGSPACE , 1987, STOC.

[30]  Dániel Marx.  Parameterized complexity of constraint satisfaction problems , 2004 .

[31]  M. Jerrum.  Counting, Sampling and Integrating: Algorithms and Complexity , 2003 .

[32]  Kord Eickmeyer,et al.  Randomisation and Derandomisation in Descriptive Complexity Theory , 2010, CSL.

[33]  Michael Alekhnovich,et al.  Resolution Is Not Automatizable Unless W[P] Is Tractable , 2008, SIAM J. Comput..

[34]  Michael Sipser,et al.  A complexity theoretic approach to randomness , 1983, STOC.

[35]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[36]  Oded Goldreich.  Randomized Methods in Computation-Lecture Notes , 2001 .

[37]  Yijia Chen,et al.  An isomorphism between subexponential and parameterized complexity theory , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[38]  Hans Kleine Büning,et al.  SAT-Problems and Reductions with Respect to the Number of Variables , 1997, J. Log. Comput..

[39]  Jörg Flum,et al.  Fixed-Parameter Tractability, Definability, and Model-Checking , 1999, SIAM J. Comput..

[40]  Jörg Flum,et al.  The Parameterized Complexity of Counting Problems , 2004, SIAM J. Comput..

[41]  Andreas Blass,et al.  On the Unique Satisfiability Problem , 1982, Inf. Control..

[42]  Yijia Chen,et al.  Lower Bounds for Kernelizations and Other Preprocessing Procedures , 2010, Theory of Computing Systems.

[43]  Kiyoshi Maruyama,et al.  The Parallel Evaluation of Arithmetic Expressions Without Division , 1973, IEEE Transactions on Computers.

[44]  Aravind Srinivasan,et al.  Randomness-optimal unique element isolation, with applications to perfect matching and related problems , 1993, SIAM J. Comput..

[45]  Jörg Flum,et al.  Bounded fixed-parameter tractability and log2n nondeterministic bits , 2004, J. Comput. Syst. Sci..

[46]  Mitsunori Ogihara,et al.  Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy , 1992, SIAM J. Comput..

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

[48]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[49]  Venkatesh Raman,et al.  Approximation Algorithms for Some Parameterized Counting Problems , 2002, ISAAC.

[50]  Kenneth W. Regan.  Efficient Reductions from NP to Parity Using Error-Correcting Codes , 1993 .

[51]  Michael R. Fellows,et al.  Parameterized Circuit Complexity and the W Hierarchy , 1998, Theor. Comput. Sci..

[52]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

[53]  Moni Naor,et al.  Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..

[54]  Seinosuke Toda,et al.  PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..

[55]  Felix Wolf.  Proceedings of the 15th international workshop on high-level parallel programming models and supportive environments , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW).

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

[57]  Kord Eickmeyer,et al.  Approximation of Natural W[P]-Complete Minimisation Problems Is Hard , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[58]  Jianer Chen.  Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters , 2008, IWPEC.

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

[60]  Richard Chang,et al.  On computing Boolean connectives of characteristic functions , 1995, Mathematical systems theory.

[61]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

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

[63]  Clemens Kaliba.  Die Transzendenz des Willens : Inaugural Dissertation zur Erlangung des Doktorwürde der Philosophischen Fakultät der Albert-Ludwigs-Universität zu Freiburg i. Br. , 1936 .

[64]  Yijia Chen,et al.  Model-checking problems, machines and parameterized complexity , 2004 .