Idziak, Pawel M. ;
Kawalek, Piotr ;
Krzaczkowski, Jacek
Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras
Abstract
Satisfiability of Boolean circuits is NPcomplete 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 wellknown 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.
BibTeX  Entry
@InProceedings{idziak_et_al:LIPIcs:2018:9599,
author = {Pawel M. Idziak and Piotr Kawalek and Jacek Krzaczkowski},
title = {{Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras}},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)},
pages = {17:117:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959770866},
ISSN = {18688969},
year = {2018},
volume = {117},
editor = {Igor Potapov and Paul Spirakis and James Worrell},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9599},
URN = {urn:nbn:de:0030drops95993},
doi = {10.4230/LIPIcs.MFCS.2018.17},
annote = {Keywords: circuit satisfiability, solving equations, Constraint Satisfaction Problem, structure theory}
}
27.08.2018
Keywords: 

circuit satisfiability, solving equations, Constraint Satisfaction Problem, structure theory 
Seminar: 

43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)

Issue date: 

2018 
Date of publication: 

27.08.2018 