Circuits, matrices, and nonassociative computation

DOI10.1006/jcss.1995.1035zbMath0837.68031OpenAlexW2175195593MaRDI QIDQ1894452

Martin Beaudry, Pierre McKenzie

Publication date: 29 April 1996

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1995.1035

zbMATH Keywords

nonassociative algebraic structures

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (8)

Equivalence classes and conditional hardness in massively parallel computations ⋮ A note on logspace optimization ⋮ Descriptive complexity of deterministic polylogarithmic time and space ⋮ Completeness results for graph isomorphism. ⋮ An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic ⋮ THE COMPLEXITY OF MODEL CHECKING FOR BOOLEAN FORMULAS ⋮ Unnamed Item ⋮ Languages recognized by finite aperiodic groupoids

This page was built for publication: Circuits, matrices, and nonassociative computation