Descriptive Complexity for Counting Complexity Classes

Descriptive Complexity has been very successful in characterizing complexity classes of decision problems in terms of the properties definable in some logics. However, descriptive complexity for counting complexity classes, such as FP and #P, has not been systematically studied, and it is not as developed as its decision counterpart. In this paper, we propose a framework based on Weighted Logics to address this issue. Specifically, by focusing on the natural numbers we obtain a logic called Quantitative Second Order Logics (QSO), and show how some of its fragments can be used to capture fundamental counting complexity classes such as FP, #P and FPSPACE, among others. We also use QSO to define a hierarchy inside #P, identifying counting complexity classes with good closure and approximation properties, and which admit natural complete problems. Finally, we add recursion to QSO, and show how this extension naturally captures lower counting complexity classes such as #L.

[1]  Stuart A. Kurtz,et al.  Gap-Definable Counting Classes , 1994, J. Comput. Syst. Sci..

[2]  Richard E. Ladner.  Polynomial Space Counting Problems , 1989, SIAM J. Comput..

[3]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[4]  M. Droste,et al.  Handbook of Weighted Automata , 2009 .

[5]  Carme Àlvarez,et al.  A Very Hard log-Space Counting Class , 1993, Theor. Comput. Sci..

[6]  Neil Immerman.  Languages Which Capture Complexity Classes (Preliminary Report) , 1983, STOC 1983.

[7]  Yann Strozecki,et al.  Enumeration Complexity of Logical Query Problems with Second-order Variables , 2011, CSL.

[8]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[9]  Lane A. Hemaspaandra,et al.  The Complexity Theory Companion , 2002, Texts in Theoretical Computer Science An EATCS Series.

[10]  Yuri Gurevich,et al.  Metafinite Model Theory , 1994, Inf. Comput..

[11]  Heribert Vollmer,et al.  The satanic notations , 1995, SIGACT News.

[12]  Phokion G. Kolaitis,et al.  Logical Definability of NP Optimization Problems , 1994, Inf. Comput..

[13]  Eric Allender,et al.  Making nondeterminism unambiguous , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[14]  Heribert Vollmer,et al.  Descriptive Complexity of #AC0 Functions , 2016, Annual Conference for Computer Science Logic.

[15]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.

[16]  John Gill,et al.  Computational Complexity of Probabilistic Turing Machines , 1977, SIAM J. Comput..

[17]  Aris Pagourtzis,et al.  The Complexity of Counting Functions with Easy Decision Version , 2006, MFCS.

[18]  Erich Grädel,et al.  Logical Definability of Counting Functions , 1996, J. Comput. Syst. Sci..

[19]  Marcelo Arenas,et al.  Descriptive Complexity for counting complexity classes , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[20]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

[21]  Aris Pagourtzis,et al.  Completeness Results for Counting Problems with Easy Decision , 2017, CIAC.

[22]  K. V. Subrahmanyam,et al.  Descriptive Complexity of #P Functions , 1995, J. Comput. Syst. Sci..

[23]  Luc Segoufin,et al.  Enumerating with constant delay the answers to a query , 2013, ICDT '13.

[24]  Kousha Etessami.  Counting Quantifiers, Successor Relations, and Logarithmic Space , 1997, J. Comput. Syst. Sci..

[25]  Martin E. Dyer,et al.  On Counting Independent Sets in Sparse Graphs , 2002, SIAM J. Comput..

[26]  Mark W. Krentel.  The Complexity of Optimization Problems , 1988, J. Comput. Syst. Sci..

[27]  Heribert Vollmer,et al.  Complexity Classes of Optimization Functions , 1995, Inf. Comput..

[28]  Erich Grädel,et al.  Finite Model Theory and Descriptive Complexity , 2007 .

[29]  E. Lander,et al.  Describing Graphs: A First-Order Approach to Graph Canonization , 1990 .

[30]  Neil Immerman,et al.  Relational queries computable in polynomial time (Extended Abstract) , 1982, STOC '82.

[31]  Erich Grädel,et al.  Capturing Complexity Classes by Fragments of Second-Order Logic , 1991, Theor. Comput. Sci..

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

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

[34]  Antoine Amarilli,et al.  A Circuit-Based Approach to Efficient Enumeration , 2017, ICALP.

[35]  Neil Immerman.  Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..

[36]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[37]  Piotr Faliszewski,et al.  The consequences of eliminating NP solutions , 2006, Comput. Sci. Rev..

[38]  Lane A. Hemachandra,et al.  A complexity theory for feasible closure properties , 1993 .

[39]  Ronald Fagin,et al.  Monadic generalized spectra , 1975, Math. Log. Q..

[40]  Phokion G. Kolaitis,et al.  Subtractive reductions and complete problems for counting complexity classes , 2000 .

[41]  S. Abiteboul,et al.  Fixpoint extensions of first-order logic and datalog-like languages , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[42]  Richard M. Karp,et al.  Monte-Carlo algorithms for enumeration and reliability problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).