Circuits and expressions with nonassociative gates
From MaRDI portal
Publication:1567406
DOI10.1006/jcss.1999.1673zbMath0955.68053OpenAlexW2170207118MaRDI QIDQ1567406
François Lemieux, Denis Thérien, Joshua Berman, Moore, Cristopher, Arthur A. Drisko
Publication date: 2000
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1999.1673
Related Items
Predicting nonlinear cellular automata quickly by decomposing them into linear ones ⋮ Dual VP classes ⋮ Extensions and tangent prolongations of differentiable loops ⋮ Abelian extensions and solvable loops. ⋮ Topological loops having solvable indecomposable Lie groups as their multiplication groups ⋮ On the computational power of probabilistic and quantum branching program ⋮ On finite loops whose inner mapping groups are Abelian
Cites Work
- Quasilinear cellular automata
- \(\Sigma_ 1^ 1\)-formulae on finite structures
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Some subclasses of context-free languages in \(NC^ 1\)
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- On the relative complexity of some languages in \(NC^ 1\)
- On uniform circuit complexity
- Extensions to Barrington's M-program model
- Predicting nonlinear cellular automata quickly by decomposing them into linear ones
- Solvable groups and loops
- On uniformity within \(NC^ 1\)
- Parity, circuits, and the polynomial-time hierarchy
- A Property of Finite Simple Non-Abelian Groups
- Contributions to the Theory of Loops
- Quasigroups. I
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Circuits and expressions with nonassociative gates
