5 citations · 5 across the 2 of their papers we have counts for
5 papers
Equation satisfiability in solvable groups
Paweł Idziak, Piotr Kawałek, Jacek Krzaczkowski +1
The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (2002) where they showed that this problem is in poly…
Even faster algorithms for CSAT over~supernilpotent algebras
Piotr Kawałek, Jacek Krzaczkowski
In this paper two algorithms solving circuit satisfiability problem over supernilpotent algebras are presented. The first one is deterministic and is faster than fastest previous a…
Intermediate problems in modular circuits satisfiability
Paweł M. Idziak, Piotr Kawałek, Jacek Krzaczkowski
In arXiv:1710.08163 a generalization of Boolean circuits to arbitrary finite algebras had been introduced and applied to sketch P versus NP-complete borderline for circuits satisfi…
Circuit equivalence in 2-nilpotent algebras
Piotr Kawałek, Michael Kompatscher, Jacek Krzaczkowski
The circuit equivalence problem of a finite algebra is the computational problem of deciding whether two circuits over define the same function or not. This…
Satisfiability in multi-valued circuits
Paweł M. Idziak, Jacek Krzaczkowski
Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial tim…