Bridges between Algebraic Automata Theory and Complexity Theory

Bridges between Algebraic Automata Theory and Complexity Theory

Cached

Download Links

by Pascal Tesson , Denis Thérien

Citations:

BibTeX

@MISC{Tesson_bridgesbetween,
    author = {Pascal Tesson and Denis Thérien},
    title = {Bridges between Algebraic Automata Theory and Complexity Theory },
    year = {}
}

Bookmark

OpenURL

Abstract

Citations

536	Communication complexity - Kushilevitz, Nisan - 1997
439	Learning regular sets from queries and counterexamples - Angluin - 1987
342	Some complexity questions related to distributive computing - Yao - 1979
262	Algebraic methods in the theory of lower bounds for Boolean circuit complexity - Smolensky - 1987
215	Tense Logic and the Theory of Linear Order - Kamp - 1968
199	Parity, circuits, and the polynomial-time hierarchy - Furst, Saxe, et al. - 1981
188	S.: Counter-Free Automata - McNaughton, Papert - 1971
184	Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1 - Barrington - 1989
139	Varieties of Formal Languages - Pin - 1986
135	Branching Programs and Binary Decision Diagrams—Theory and Applications - Wegener - 2000
126	On uniformity within NC - Barrington, Immerman, et al. - 1990
110	On finite monoids having only trivial subgroups - Schützenberger - 1965
107	Closure properties of constraints - Jeavons, Cohen, et al. - 1997
96	Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs - Babai, Nisan, et al. - 1992
95	Complexity classes in communication complexity theory (preliminary version - Babai, Frankl, et al. - 1986
89	Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser - Straubing - 1994
88	On the power of small-depth threshold circuits Computational Complexity - Hastad, Goldmann - 1991
77	Piecewise testable events - Simon - 1975
74	Regular languages are testable with a constant number of queries - Alon, Newman, et al. - 1999
46	Finite semigroups and universal algebra - Almeida - 1995
43	Non-uniform automata over groups - BARRINGTON, STRAUBING, et al. - 1990
37	Unbounded fan-in circuits and associative functions - Chandra, Fortune, et al. - 1983
37	On the expressive power of temporal logic - Cohen, Perrin, et al. - 1993
36	Profinite semigroups, Mal’cev products and identities - Pin, Weil - 1996
34	Finite Monoids and the Fine Structure of NC 1 - Barrington, Therien - 1988
32	Syntactic semigroups - Pin - 1996
30	Separation of the monotone NC hierarchy - Raz, McKenzie - 1999
29	Polynomial closure and unambiguous product - Pin, Weil - 1997
27	On the power of polynomial time bit-reductions - Hertrampf, Lautemann, et al. - 1993
27	Over words, two variables are as powerful as one quantifier alternation - Thérien, Wilke - 1998
25	Lower bounds for Lovász-Schrijver systems and beyond follow from multiparty communication complexity - Beame, Pitassi, et al.
21	Logspace and logtime leaf languages - Jenner, McKenzie, et al. - 1994
19	Superlinear lower bounds for bounded-width branching programs - Barrington, Straubing - 1995
19	Separating the communication complexities of MOD m and MOD p circuits - Grolmusz - 1992
18	Learning behaviors of automata from multiplicity and equivalence queries - Bergadano, Varricchio - 1996
18	The BNS lower bound for multi-party protocols is nearly optimal - Grolmusz - 1994
18	Diamonds are forever: the variety DA - Tesson, Thérien - 2001
17	On logical descriptions of regular languages - Straubing
14	Constant width planar computation characterizes ACC 0 - Hansen - 2006
14	Closure of varieties of languages under products with counter - Weil - 1992
13	On the acceptance power of regular languages - Borchert
13	Subword counting and nilpotent groups - Thérien - 1983
12	Functions with Bounded Symmetric Communication Complexity and Circuits with MOD m Gates - Szegedy
12	Computational complexity questions related to finite monoids and semigroups - Tesson - 2003
12	Complete classifications for the communication complexity of regular languages - Tesson, Thérien
11	An algebraic approach to communication complexity - Raymond, Tesson, et al. - 1998
10	NC 1 : The automatatheoretic viewpoint - McKenzie, Péladeau, et al. - 1991
10	Regular languages defined by generalized first-order formulas with a bounded number of bound variables - Straubing, Thérien
9	Bounded-depth circuits: separating wires from gates - Kouck´y, Pudlák, et al.
9	Nesting until and since in linear temporal logic - Wilke