Uniform characterizations of complexity classes

In the past few years, generalized operators (a. k. a. leaf languages) in the context of polynomial-time machines, and gates computing arbitrary groupoidal functions in the context of Boolean circuits, have raised much interest. We survey results from both areas, point out connections between them, and present relationships to a generalized quantifier concept from finite model theory.

[1]  David A. Mix Barrington.  Quasipolynomial size circuit classes , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[2]  Perlindström.  First Order Predicate Logic with Generalized Quantifiers , 1966 .

[3]  Riccardo Silvestri,et al.  The general notion of a dot-operator , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[4]  Neil Immerman,et al.  On Uniformity within NC¹ , 1990, J. Comput. Syst. Sci..

[5]  Ulrich Hertrampf.  Acceptance by transformation monoids (with an application to local self reductions) , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[6]  Eric Allender,et al.  The Permanent Requires Large Uniform Threshold Circuits , 1999, Chic. J. Theor. Comput. Sci..

[7]  Thomas Schwentick,et al.  The Descriptive Complexity Approach to LOGCFL , 1998, J. Comput. Syst. Sci..

[8]  Heribert Vollmer,et al.  Uniformly Defining Complexity Classes of Functions , 1998, STACS.

[9]  Heribert Vollmer.  Relating Polynomial Time to Constant Depth , 1998, Theor. Comput. Sci..

[10]  Thomas Schwentick,et al.  On the power of polynomial time bit-reductions , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[11]  Howard Straubing.  Finite Automata, Formal Logic, and Circuit Complexity , 1994, Progress in Theoretical Computer Science.

[12]  Journal of the Association for Computing Machinery , 1961, Nature.

[13]  Pierre McKenzie,et al.  Extensions to Barrington's M-program model , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[14]  Bernd Borchert,et al.  On the Acceptance Power of Regular Languages , 1994, Theor. Comput. Sci..

[15]  Heribert Vollmer,et al.  Lindström Quantifiers and Leaf Language Definability , 1996, Int. J. Found. Comput. Sci..

[16]  Heribert Vollmer,et al.  Nondeterministic NC 1 Computation. , 1996 .

[17]  Ulrich Hertrampf.  Classes of Bounded Counting Type and their Inclusion Relations , 1995, STACS.

[18]  Lance Fortnow,et al.  The Role of Relativization in Complexity Theory , 1994, Bull. EATCS.

[19]  Heribert Vollmer,et al.  Introduction to Circuit Complexity , 1999, Texts in Theoretical Computer Science An EATCS Series.

[20]  Helmut Veith,et al.  Succinct representation, leaf languages, and projection reductions , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[21]  Heribert Vollmer.  A Generalized Quantifier Concept in Computational Complexity Theory , 1997, ESSLLI.

[22]  David A. Mix Barrington,et al.  Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1986, STOC '86.

[23]  Pierluigi Crescenzi,et al.  A Uniform Approach to Define Complexity Classes , 1992, Theor. Comput. Sci..

[24]  A. Yao.  Separating the polynomial-time hierarchy by oracles , 1985 .

[25]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[26]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[27]  Denis Thérien,et al.  Logspace and Logtime Leaf Languages , 1996, Inf. Comput..

[28]  N. Vereshchagin.  RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS , 1994 .

[29]  N. Immerman,et al.  On uniformity within NC 1 . , 1988 .

[30]  Heribert Vollmer,et al.  On the power of number-theoretic operations with respect to counting , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

[31]  Jin-Yi Cai,et al.  PSPACE Survives Constant-Width Bottlenecks , 1991, Int. J. Found. Comput. Sci..