Even Faster Algorithms for CSAT Over supernilpotent Algebras.

DOI10.4230/LIPIcs.MFCS.2020.55OpenAlexW3082636827MaRDI QIDQ5089225

Jacek Krzaczkowski, Piotr Kawałek

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/2002.08634

zbMATH Keywords

solving equationscircuit satisfiabilitysatisfiability in groupssupernilpotent algebras

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Chevalley-Warning type results on abelian groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some applications of higher commutators in Mal'cev algebras
• The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
• The complexity of the equation solvability problem over nilpotent groups
• The complexity of solving equations over finite groups
• Wreath products of algebras: Generalizing the Krohn-Rhodes theorem to arbitrary algebras
• The complexity of the equivalence and equation solvability problems over meta-abelian groups
• Bounding the free spectrum of nilpotent algebras of prime power order
• TERM EQUATION SATISFIABILITY OVER FINITE ALGEBRAS
• THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS
• The equation solvability problem over supernilpotent algebras with Mal’cev term
• The complexity of the equation solvability and equivalence problems over finite groups
• Satisfiability in multi-valued circuits
• Intermediate problems in modular circuits satisfiability
• STACS 2004
• Congruence modular varieties with small free spectra

This page was built for publication: Even Faster Algorithms for CSAT Over supernilpotent Algebras.