Piotr Kawalek

According to our database, Piotr Kawalek authored at least 9 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Equation Satisfiability in Solvable Groups.

Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Weiß

Theory Comput. Syst., August, 2024

Circuit Equivalence in 2-Nilpotent Algebras.

Piotr Kawalek, Michael Kompatscher, Jacek Krzaczkowski

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023

Violating Constant Degree Hypothesis Requires Breaking Symmetry.

Piotr Kawalek, Armin Weiß

CoRR, 2023

2022

Satisfiability of Circuits and Equations over Finite Malcev Algebras.

Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Complexity of Modular Circuits.

Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Satisfiability Problems for Finite Groups.

Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Weiß

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2020

Even Faster Algorithms for CSAT Over supernilpotent Algebras.

Piotr Kawalek, Jacek Krzaczkowski

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Intermediate problems in modular circuits satisfiability.

Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

2018

Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras.

Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018