scientific article; zbMATH DE number 7566068
From MaRDI portal
Publication:5094140
Publication date: 2 August 2022
Full work available at URL: https://arxiv.org/abs/1911.01479
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
nilpotent algebrasMaltsev algebrasCC-circuitscircuit equivalence problemcircuit satisfaction problem
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some applications of higher commutators in Mal'cev algebras
- A new characterization of \(\text{ACC}^{0}\) and probabilistic \(\text{CC}^{0}\)
- \(NC^ 1\): The automata-theoretic viewpoint
- Non-uniform automata over groups
- Free spectra of nilpotent varieties
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- A note on a theorem of Barrington, Straubing and Thérien
- The complexity of solving equations over finite groups
- Equivalence and equation solvability problems for the alternating group \(\mathbf A_4\).
- The equivalence problem for finite rings
- Bounding the free spectrum of nilpotent algebras of prime power order
- The Circuit-Input Game, Natural Proofs, and Testing Circuits With Data
- Parity, circuits, and the polynomial-time hierarchy
- The equation solvability problem over supernilpotent algebras with Mal’cev term
- Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras.
- A Proof of the CSP Dichotomy Conjecture
- Satisfiability in multi-valued circuits
- Intermediate problems in modular circuits satisfiability
- Congruence modular varieties with small free spectra
This page was built for publication:
