Circuits and expressions with nonassociative gates
type: Item
instance of: scholarly article
title: Circuits and expressions with nonassociative gates
zbMATH Open document ID: 0955.68053
author: Denis Thérien
author: François Lemieux
author: Joshua Berman
author: Cristopher Moore
author: Arthur A. Drisko
published in: Journal of Computer and System Sciences
publication date: 2000-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 1455740
zbMATH Keywords: poly-Abelian groupoids
MaRDI profile type: Publication
full work available at URL: jcss.1999.1673
OpenAlex ID: W2170207118
cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures
cites work: Quasigroups. I
cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
cites work: On the relative complexity of some languages in \(NC^ 1\)
cites work: On uniformity within \(NC^ 1\)
cites work: Extensions to Barrington's M-program model
cites work: Q4281558
cites work: Contributions to the Theory of Loops
cites work: Q5515384
cites work: Q4470490
cites work: Q4039680
cites work: Parity, circuits, and the polynomial-time hierarchy
cites work: Q4843270
cites work: Q4124997
cites work: Some subclasses of context-free languages in \(NC^ 1\)
cites work: A Property of Finite Simple Non-Abelian Groups
cites work: Predicting nonlinear cellular automata quickly by decomposing them into linear ones
cites work: Quasilinear cellular automata
cites work: Q3221403
cites work: Q3998783
cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
cites work: Q4132093
cites work: On uniform circuit complexity
cites work: Q3926778
cites work: Q3739181
cites work: Solvable groups and loops
cites work: Q4132714
DOI: 10.1006/JCSS.1999.1673
description: scientific article; zbMATH DE number 1455740