Michal Garlík

According to our database, Michal Garlík authored at least 7 papers between 2015 and 2026.

Collaborative distances:

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

2026

The Weak Rank Principle: Lower Bounds and Applications.

Michal Garlík, Svyatoslav Gryaznov, Hanlin Ren, Iddo Tzameret

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2024

Lower Bounds for Regular Resolution over Parities.

Klim Efremenko, Michal Garlík, Dmitry Itsykson

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Failure of Feasible Disjunction Property for k-DNF Resolution and NP-Hardness of Automating It.

Michal Garlík

Proceedings of the 39th Computational Complexity Conference, 2024

2019

Resolution Lower Bounds for Refutation Statements.

Michal Garlík

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018

Some Subsystems of Constant-Depth Frege with Parity.

Michal Garlík, Leszek Aleksander Kolodziejczyk

ACM Trans. Comput. Log., 2018

2016

Construction of models of bounded arithmetic by restricted reduced powers.

Michal Garlík

Arch. Math. Log., 2016

2015

A new proof of Ajtai's completeness theorem for nonstandard finite structures.

Michal Garlík

Arch. Math. Log., 2015