dr Piotr Kawałek

Equation satisfiability in solvable groups, Theory of Computing Systems (2022),

Complexity of Modular Circuits, IEEE Symposium on Logic in Computer Science [LICS] vol. LICS'22; Proc. of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (2022),

Satisfiability problems for finite groups, International Colloquium on Automata Languages and Programming [ICALP](MAIN) vol. ICALP'22; 49th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022), 127:1-127:20

Satisfiability of Circuits and Equations over Finite Malcev Algebras, International Symposium on Theoretical Aspects of Computer Science [STACS] vol. STACS'22; Proc. of the 39th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022), 37:1-37:14

Intermediate problems in modular circuits satisfiability, IEEE Symposium on Logic in Computer Science [LICS] vol. Association for Computing Machinery (ACM) (2020), 578–590

Even faster algorithms for CSAT over supernilpotent algebras, International Symposium on Mathematical Foundations of Computer Science [MFCS] vol. 170 (2020), 55:1-55:13

Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras vol. Leibniz International Proceedings in Informatics (LIPIcs) (2018), "43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)", Schloss Dagstuhl – Leibniz-Zentrum für Informatik

AAA98 – 98. workshop on General Algebra, Technische Universität Dresden, Drezno, Niemcy, 2019-06-21 - 2019-06-23

43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), University of Liverpool, Liverpool, Wielka Brytania, 2018-08-27 - 2018-08-31