François Bedard, François Lemieux, Pierre McKenzie  Home/Search
Context Related
| wwwdim.uqac.uquebec.ca/~f...BeLeMc91.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: wwwdim.uqac.uquebe...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Barrington's "polynomial length program over a monoid" is a model of computation which has been studied intensively in connection with the structure of the complexity class NC 1 [Ba86, BaTh87, BaTh88, McTh89, Pe89]. Here two extensions of the model are considered. First, with the use of non associative structures (hence groupoids) instead of (associative) monoids, polynomial length program characterizations of complexity classes TC 0 , NL, and LOGCFL, as well as new characterizations of... (Update)
Context of citations to this paper: More
.... word languages: indeed the nite groupoids recognize exactly the class of the context free languages (a result found independently in [10] and [3]) under the following convention. A language L A is recognized by groupoid G i there exist a monoid homomorphism : A and a...
.... context free, and every contextfree language is a homomorphic pre image of a groupoid word problem (this result is credited to Valiant in [BLM93]) The following de nition is due to B edard, Lemieux, and McKenzie [BLM93] De nition 7. A groupoidal quanti er is a Lindstr om...
Cited by: More
Arithmetic Complexity, Kleene Closure, and Formal Power.. - Allender, Arvind, Mahajan (2003) (Correct)
Uniform Characterizations of Complexity Classes - Vollmer (1999) (Correct)
The Descriptive Complexity Approach to LOGCFL - Lautemann, McKenzie.. (1999) (Correct)
Similar documents (at the sentence level):
6.0%: Finite Groupoids and their Applications to Computational Complexity - Lemieux (1996) (Correct)
Active bibliography (related documents): More All
0.3: Equation Satisfiability and Program Satisfiability .. - Barrington.. (2000) (Correct)
0.3: The Complexity of Solving Equations over Finite Groups - Goldmann, Russell (2002) (Correct)
0.2: Simulating Threshold Circuits by Majority Circuits - Goldmann, Karpinski (1993) (Correct)
Similar documents based on text: More All
0.3: Variance Reduction Of Monte Carlo And Randomized Quasi-Monte.. - Ameur, al. (1999) (Correct)
0.3: Arithmetic Circuits and Polynomial Replacement Systems - McKenzie, Vollmer, Wagner (1999) (Correct)
0.3: Classification of the Linear Languages Based on Group Varieties.. - Lemieux (2001) (Correct)
Related documents from co-citation: More All
13: Finite monoids and the fine structure of NC (context) - Barrington, Th'erien - 1988
9: Bounded-width polynomial-size branching programs recognize exactly those languag.. (context) - Barrington - 1989
8: The Complexity of Computing over Quasigroups - Caussinus, Lemieux - 1994
BibTeX entry: (Update)
F. B'edard, F. Lemieux and P.McKenzie, "Extensions to Barrington's M-program model", Theoretical Computer Science 107,199331--61 http://citeseer.ist.psu.edu/399668.html More
@misc{ b'edard-extensions,
author = "F. B'edard and F. Lemieux and P. McKenzie",
title = "Extensions to Barrington's M-program model",
text = "F. B'edard, F. Lemieux and P.McKenzie, Extensions to Barrington's M-program
model, Theoretical Computer Science 107,199331--61",
url = "citeseer.ist.psu.edu/399668.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
202 The Complexity of Boolean Functions - Wegener - 1987
168 A Taxonomy of Problems with Fast Parallel Algorithms (context) - Cook - 1985
92 Constant Depth Reducibility (context) - Chandra, Stockmeyer et al. - 1984
85 Turing machines that take advice (context) - Karp, Lipton - 1982
70 The boolean formula value problem is in ALOGTIME - Buss - 1987
61 Relations Among Complexity Measures (context) - Pippenger, Fischer - 1979
56 Finite Monoids and the Fine Structure of NC (context) - Barrington, Th'erien - 1988
53 Topics in Algebra (context) - Herstein - 1975
51 the Tape Complexity of Deterministic Context-Free Languages (context) - Sudburough - 1978
49 Tree-Size Bounded Alternation (context) - Ruzzo - 1980
41 Properties that Characterize LOGCFL (context) - Venkateswaran - 1987
38 The Complexity of Iterated Multiplication - Immerman, Landau - 1989
37 Multi-party protocols (context) - Chandra, Furst et al. - 1983
36 An optimal parallel algorithm for formula evaluation - Buss, Cook et al. - 1989
31 Parallel Computation with Threshold Functions (context) - Parberry, Schnitger - 1988
29 Problems Complete for Deterministic Logarithmic Space (context) - Cook, McKenzie - 1987
26 General Context-Free Recognition in Less than Cubic Time (context) - Valiant - 1975
21 The recognition problem for the set of perfect squares (context) - Cobham - 1966
19 the Foundations of Computer Science (context) - Pippenger, Resource et al. - 1979
17 The Hardest Context-Free Language (context) - Greibach - 1973
17 NC 1 : the automata-theoretic viewpoint (context) - McKenzie, P'eladeau et al.
11 Private communication (context) - Anderson, Barrington - 1989
10 Automata Theory Meets Circuit Complexity (context) - McKenzie, Th'erien - 1989
7 Bounds for width-two branching programs (context) - Borodin, Dolev et al. - 1983
4 Computer and Systems Science (context) - Ruzzo, circuit - 1981
3 Sur les Langages Reconnus par des Groupes Nilpotents (context) - Th'erien, P'eladeau - 1988
2 Introduction to Formal Langage Theory (context) - Harrison - 1978
2 A Note on Tape-Bounded Complexity Classes and Linear Context.. (context) - Sudburough - 1975
1 Private comunication (context) - Klapper, Longpr'e - 1988
1 Classes of Boolean Circuits and Varieties of Finite Monoids (context) - P'eladeau
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://wwwdim.uqac.uquebec.ca/~flemieux/publications.html): More
Finite Loops Recognize Exactly the Regular Open Languages - Beaudry, Lemieux.. (1997) (Correct)
Circuits and Expressions with Non-Associative Gates - Moore, Thérien.. (Correct)
Polyabelian loops and Boolean completeness - Lemieux, Moore, Thérien (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