See this document in CiteSeerX!

Circuits and Expressions with Non-Associative Gates  (Make Corrections)  (6 citations)
Cristopher Moore, Denis Thérien, François Lemieux, Joshua Berman, Arthur Drisko
Journal of Computer and System Sciences



  Home/Search   Context   Related

 
View or download:
wwwdim.uqac.uquebec.ca/~fle...jcss99.ps
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  wwwdim.uqac.uquebe...publications (more)
(Enter author homepages)

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

Abstract: We consider circuits and expressions whose gates carry out multiplication in a non-associative groupoid such as a quasigroup or loop. We define a class we call the polyabelian groupoids, formed by iterated quasidirect products of Abelian groups. We show that a quasigroup can express arbitrary Boolean functions if and only if it is not polyabelian, in which case its Expression Evaluation and Circuit Value problems are NC¹-complete and P-complete respectively. This is not true or groupoids... (Update)

Context of citations to this paper:   More

...computational complexity. Evaluating circuits and expressions in such a groupoid are P complete and NC 1 complete respectively [15], and solving equations of constants and variables in non solvable groups is NP complete [9] On the other hand, if a groupoid lacks this...

...no such theory exists for context free languages. Nevertheless, this topic has been the subjet of recent investigations (e.g. [18, 21, 10, 13, 19, 7, 8, 20]) that we briefly describe here. A groupoid G is a set with a binary operation that can be non associative. All groupoids...

Cited by:   More
Subtree-Counting Loops - Lemieux, Moore, Thérien   (Correct)
Counting, Fanout, And The Complexity Of Quantum Acc - Green, al. (2002)   (Correct)
Classification of the Linear Languages Based on Group Varieties.. - Lemieux (2001)   (Correct)

Similar documents (at the sentence level):
29.4%:   Polyabelian loops and Boolean completeness - Lemieux, Moore, Thérien   (Correct)
27.2%:   Circuits and Expressions with Non-Associative Gates - Berman, Drisko, Lemieux..   (Correct)
7.4%:   Circuits and Expressions with Non-Associative.. - Berman, Drisko..   (Correct)

Active bibliography (related documents):   More   All
0.4:   Predicting Non-linear Cellular Automata Quickly by Decomposing.. - Moore (1997)   (Correct)
0.4:   Circuit Complexity before the Dawn of the New Millennium - Allender (1996)   (Correct)
0.3:   Star-Free Open Languages and Aperiodic Loops - Beaudry, Lemieux, Thérien (2001)   (Correct)

Similar documents based on text:   More   All
0.3:   Etale Groupoids, Derived Categories, and Operations. - Moerdijk   (Correct)
0.3:   On Symplectic And Contact Groupoids - Libermann (1993)   (Correct)
0.3:   Foliation Groupoids and Their Cyclic Homology - Crainic, Moerdijk   (Correct)

Related documents from co-citation:   More   All
4:   The Complexity of Computing over Quasigroups - Caussinus, Lemieux - 1994
4:   Bounded-width polynomial-size branching programs recognize exactly those languag.. (context) - Barrington - 1989
3:   Finite loops recognize exactly the regular open languages - Beaudry, Lemieux et al. - 1997

BibTeX entry:   (Update)

F. Lemieux, C. Moore, D. Therien, J. Berman, and A. Drisko, \Circuits and Expressions with Non-Associative Gates." To appear in J. Comput. System Sci. http://citeseer.ist.psu.edu/395248.html   More

@article{ moore00circuits,
    author = "Cristopher Moore and Denis Therien and Francois Lemieux and Joshua Berman and Arthur Drisko",
    title = "Circuits and Expressions with Nonassociative Gates",
    journal = "Journal of Computer and System Sciences",
    volume = "60",
    number = "2",
    pages = "368-394",
    year = "2000",
    url = "citeseer.ist.psu.edu/395248.html" }
Citations (may not include all citations):
951   Computational Complexity (context) - Papadimitriou - 1994
189   Algebraic methods in the theory of lower bounds for Boolean .. (context) - Smolensky - 1987
125   On uniform circuit complexity (context) - Ruzzo - 1981
116   On Uniformity Within NC - Barrington, Immerman et al. - 1990
114   Bounded-width polynomial-size branching programs recognize e.. (context) - Barrington - 1989
97   Limits to Parallel Computation: P- Completeness Theory - Greenlaw, Hoover et al. - 1995
82   The Theory of Groups (context) - Hall - 1976
75   and the polynomial-time hierarchy (context) - Furst, Saxe et al. - 1984
70   The Boolean formula value problem is in ALOGTIME - Buss - 1987
65   The circuit value problem is LOGSPACE-complete for P (context) - Ladner - 1975
51   Lower bounds for the size of circuits of bounded depth with .. (context) - Razborov - 1987
31   A Survey of Binary Systems (context) - Bruck - 1966
27   Extension to Barrington's M-program Model - edard, Lemieux et al. - 1993
21   Springer-Verlag (context) - Suzuki, Theory - 1982
19   Quasigroups and Loops: Theory and Applications (context) - Chein, ugfelder et al. - 1990
18   Threshold circuits of small majority-depth - Maciel, Th - 1995
16   Quasi-linear Cellular Automata - Moore - 1997
14   Contributions to the theory of loops (context) - Bruck - 1946
12   Finite Groupoids and their Applications to Computational Com.. - Lemieux - 1996
11   The Complexity of Computing over Quasigroups - Caussinus, Lemieux - 1994
9   Predicting Non-linear Cellular Automata Quickly by Decomposi.. - Moore - 1998
6   Quasigroups and Loops: An Introduction (context) - ugfelder - 1990
6   Circuits with monoidal gates (context) - Beaudry, McKenzie et al. - 1993
5   Polygonal Publishing House (context) - Weinstein, Groups - 1977
5   Solvable groups and loops (context) - Vesanen - 1996
4   formulae on nite structures (context) - Ajtai - 1983
4   the relative complexity of some languages in NC (context) - Barrington, Corbett - 1989
4   Some subclasses of context-free languages in NC (context) - Ibarra, Jiang et al. - 1988
3   Les Presses de L'Universite de Montreal (context) - Szendrei, Universal - 1986
3   Completeness properties of multiple{valued logic algebras (context) - Rosenberg - 1977
2   locally nite varieties with permuting congruence relations (context) - McKenzie, minimal - 1976
2   A property of nite simple non-Abelian groups (context) - Maurer, Rhodes - 1965

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)
Polyabelian loops and Boolean completeness - Lemieux, Moore, Thérien   (Correct)
Star-Free Open Languages and Aperiodic Loops - Beaudry, Lemieux, Thérien (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