2026-07-23T00:21:44Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9599 2024-03-06T10:44:30Z ddc:004 open_access

Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras Idziak, Pawel M. Kawalek, Piotr Krzaczkowski, Jacek circuit satisfiability solving equations Constraint Satisfaction Problem structure theory Satisfiability of Boolean circuits is NP-complete in general but becomes polynomial time when restricted for example either to monotone gates or linear gates. We go outside Boolean realm and consider circuits built of any fixed set of gates on an arbitrary large finite domain. From the complexity point of view this is connected with solving equations over finite algebras. This in turn is one of the oldest and well-known mathematical problems which for centuries was the driving force of research in algebra. Let us only mention Galois theory, Gaussian elimination or Diophantine Equations. The last problem has been shown to be undecidable, however in finite realms such problems are obviously decidable in nondeterministic polynomial time. A project of characterizing finite algebras m A with polynomial time algorithms deciding satisfiability of circuits over m A has been undertaken in [Pawel M. Idziak and Jacek Krzaczkowski, 2018]. Unfortunately that paper leaves a gap for nilpotent but not supernilpotent algebras. In this paper we discuss possible attacks on filling this gap. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Pawel M. Idziak and Piotr Kawalek and Jacek Krzaczkowski 2018 Is Part Of LIPIcs, Volume 117, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2018.17 urn:nbn:de:0030-drops-95993 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.17 eng https://creativecommons.org/licenses/by/3.0/legalcode