5 citations · 5 across the 4 of their papers we have counts for
3 papers · 1 filter
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…