Michal Garlík

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 11

Top Topics

Worst Case Analysis

Boolean Functions

Attribute Efficient Learning

Top Venues

Electron. Colloquium Comput. Complex.

Arch. Math. Log.

ACM Trans. Comput. Log.

Publications

Michal Garlík
Failure of Feasible Disjunction Property for k-DNF Resolution and NP-Hardness of Automating It. CCC (2024)
Klim Efremenko, Michal Garlík, Dmitry Itsykson
Lower Bounds for Regular Resolution over Parities. STOC (2024)
Klim Efremenko, Michal Garlík, Dmitry Itsykson
Lower bounds for regular resolution over parities. Electron. Colloquium Comput. Complex. (2023)
Michal Garlík
Failure of Feasible Disjunction Property for $k$-DNF Resolution and NP-hardness of Automating It. Electron. Colloquium Comput. Complex. 27 (2020)
Michal Garlík
Failure of Feasible Disjunction Property for k-DNF Resolution and NP-hardness of Automating It. CoRR (2020)
Michal Garlík
Resolution Lower Bounds for Refutation Statements. MFCS (2019)
Michal Garlík
Resolution Lower Bounds for Refutation Statements. CoRR (2019)
Michal Garlík
Resolution Lower Bounds for Refutation Statements. Electron. Colloquium Comput. Complex. 26 (2019)
Michal Garlík, Leszek Aleksander Kolodziejczyk
Some Subsystems of Constant-Depth Frege with Parity. ACM Trans. Comput. Log. 19 (4) (2018)
Michal Garlík
Construction of models of bounded arithmetic by restricted reduced powers. Arch. Math. Log. 55 (5-6) (2016)
Michal Garlík
A new proof of Ajtai's completeness theorem for nonstandard finite structures. Arch. Math. Log. 54 (3-4) (2015)