The complexity of problems connected with two-element algebras

MaRDI QIDQ2888155zbMATH OpenFDO

Authors Tomasz A. Gorazd, Jacek Krzaczkowski

Publication date 30 May 2012

Published in Reports on Mathematical Logic (Search for Journal in Brave)

zbMATH Keywords

complexityequivalence problemsSATtwo-element algebras

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1304317
• Computational complexity of some problems involving congruences on algebras
• Term equation satisfiability over finite algebras
• Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
• Classifying the Complexity of Constraints Using Finite Algebras

Cited in

(13)

• Equivalence and equation solvability problems for the alternating group A₄.
• Solving a fixed number of equations over finite groups
• The complexity of the equivalence and equation solvability problems over meta-abelian groups
• Loosely-abelian algebras
• Term equation satisfiability over finite algebras
• Expressive power and complexity in algebraic logic
• Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
• Satisfiability in MultiValued Circuits
• Even Faster Algorithms for CSAT Over supernilpotent Algebras.
• Solving systems of equations in supernilpotent algebras
• Computational complexity of some problems involving congruences on algebras
• Circuit equivalence in 2-nilpotent algebras
• An assertion concerning functionally complete algebras and NP-completeness

This page was built for publication: The complexity of problems connected with two-element algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2888155)