Even Faster Algorithms for CSAT Over supernilpotent Algebras.
From MaRDI portal
Publication:5089225
Cites work
- Bounding the free spectrum of nilpotent algebras of prime power order
- Congruence modular varieties with small free spectra
- scientific article; zbMATH DE number 4035895 (Why is no real title available?)
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- Intermediate problems in modular circuits satisfiability
- On the number of finite Mal'tsev algebras
- Satisfiability in multi-valued circuits
- Satisfying degree-\(d\) equations over \(\mathrm{GF}[2]^n\)
- Some applications of higher commutators in Mal'cev algebras
- STACS 2004
- Term equation satisfiability over finite algebras
- THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS
- The complexity of problems connected with two-element algebras
- The complexity of solving equations over finite groups
- The complexity of the equation solvability and equivalence problems over finite groups
- The complexity of the equation solvability problem over nilpotent groups
- The complexity of the equivalence and equation solvability problems over meta-abelian groups
- The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
- The equation solvability problem over supernilpotent algebras with Mal’cev term
- The extended equivalence and equation solvability problems for groups
- Wreath products of algebras: Generalizing the Krohn-Rhodes theorem to arbitrary algebras
Cited in
(3)
This page was built for publication: Even Faster Algorithms for CSAT Over supernilpotent Algebras.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089225)
