See this document in CiteSeerX!

Languages Defined With Modular Counting  (Make Corrections)  
Quantifiers Howard Straubing Computer Science Department Boston College...



  Home/Search   Context   Related

 
View or download:
umd.edu/~gasarch/ramsey/modquant.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  umd.edu/~gasarch/ramsey/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We prove that a regular language defined by a boolean combination of generalized \Sigma 1-sentences built using modular counting quantifiers can be defined by a boolean combination of \Sigma 1-sentences in which only regular numerical predicates appear. The same statement, with "\Sigma 1 " replaced by "first-order" is equivalent to the conjecture that the non-uniform circuit complexity class ACC is strictly contained in NC The argument introduces some new techniques, based on a... (Update)

Similar documents (at the sentence level):
74.2%:   Languages Defined With Modular Counting Quantifiers - Straubing (2001)   (Correct)

Active bibliography (related documents):   More   All
0.5:   When Can One Finite Monoid Simulate Another? - Straubing   (Correct)
0.5:   Circuits and Expressions with Non-Associative Gates - Berman, Drisko, Lemieux..   (Correct)
0.4:   A Note on MOD p - MOD m Circuits - Straubing, Therien   (Correct)

Similar documents based on text:   More   All
0.4:   The Power of Local Self-Reductions - Richard Beigel (1995)   (Correct)
0.3:   Circuit Complexity and the Expressive Power of Generalized.. - Straubing   (Correct)
0.3:   Quality Assurance in Data Collection - Edited By Michael   (Correct)

BibTeX entry:   (Update)

@misc{ straubing-languages,
  author = "Quantifiers Howard Straubing",
  title = "Languages Defined With Modular Counting",
  url = "citeseer.ist.psu.edu/687668.html" }
Citations (may not include all citations):
327   Languages and Machines (context) - Eilenberg - 1976
211   Languages That Capture Complexity Classes - Immerman - 1987
189   Algebraic Methods in the Theory of Lower Bounds for Boolean .. (context) - Smolensky - 1987
127   Counter-Free Automata (context) - McNaughton, Papert - 1971
110   Ramsey Theory (context) - Graham, Rothschild et al. - 1990
100   Weak Second-order Arithmetic and Finite Automata (context) - Buchi - 1960
63   Varieties of Formal Languages (context) - Pin - 1986
57   and Circuit Complexity (context) - Straubing, Automata et al. - 1994
56   Finite Monoids and the Fine Structure of NC (context) - Barrington, Th'erien - 1988
45   Parity, Circuits, and the Polynomial Time Hierarchy (context) - Furst, Saxe et al. - 1984
43   Bounded-Width Polynomial-Size Branching Programs Recognize E.. (context) - Barrington - 1989
40   Nonuniform Automata over Groups (context) - Barrington, Straubing et al. - 1990
30   Piecewise Testable Events (context) - Simon - 1975
19   Regular Languages Defined with Generalized Quantifiers (context) - Straubing, Th'erien et al. - 1995
17   Regular Languages in NC (context) - Barrington, Compton et al. - 1992
12   Superlinear Lower Bounds for Boundedwidth Branching Programs - Barrington, Straubing - 1995
10   A Logic for Constant-Depth Circuits (context) - Gurevich, Lewis - 1984
8   Classification of finite monoids: the language approach (context) - Th'erien - 1981
5   Lower Bounds for (MOD p-MOD m) Circuits - Grolmusz, Tardos - 1998
5   the Computational Power of Depth 2 Circuits with Threshold a.. (context) - Krause, Pudlak - 1994
3   Programs over Semigroups of Dot-depth One - Maciel, P'eladeau et al. - 1996
3   Bounded-depth, Polynomial-size Circuits for Symmetric Functi.. (context) - Fagin, Klawe et al. - 1985
2   Finite Semigroup Varieties Defined by Programs (context) - P'eladeau, Straubing et al. - 1997
2   Sigma 1 formulae on finite structures (context) - Ajtai - 1983

Documents on the same site (http://www.cs.umd.edu/~gasarch/ramsey/):   More
Parameterized Complexity of Finding Subgraphs with Hereditary.. - Khot, Raman (2002)   (Correct)
Lower Bounds for Approximations by Low Degree Polynomials over.. - Alon, Beigel (2001)   (Correct)
XML with Data Values: Typechecking Revisited - Alon, Milo, Suciu, Neven (2001)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC