Michal Garlík

12 papers A* 1A 1B 1Journal 9
YearRankTypeTitle / Venue / Authors
2025 J jnl
Lower Bounds for Regular Resolution over Parities.
SIAM J. Comput.
Klim Efremenko, Michal Garlík, Dmitry Itsykson
2024 A conf
Failure of Feasible Disjunction Property for k-DNF Resolution and NP-Hardness of Automating It.
CCC
Michal Garlík
2024 A* conf
Lower Bounds for Regular Resolution over Parities.
STOC
Klim Efremenko, Michal Garlík, Dmitry Itsykson
2023 J jnl
Lower bounds for regular resolution over parities.
Electron. Colloquium Comput. Complex.
Klim Efremenko, Michal Garlík, Dmitry Itsykson
2020 J jnl
Failure of Feasible Disjunction Property for $k$-DNF Resolution and NP-hardness of Automating It.
Electron. Colloquium Comput. Complex.
Michal Garlík
2020 J jnl
Failure of Feasible Disjunction Property for k-DNF Resolution and NP-hardness of Automating It.
CoRR
Michal Garlík
2019 B conf
Resolution Lower Bounds for Refutation Statements.
MFCS
Michal Garlík
2019 J jnl
Resolution Lower Bounds for Refutation Statements.
CoRR
Michal Garlík
2019 J jnl
Resolution Lower Bounds for Refutation Statements.
Electron. Colloquium Comput. Complex.
Michal Garlík
2018 J jnl
Some Subsystems of Constant-Depth Frege with Parity.
ACM Trans. Comput. Log.
Michal Garlík, Leszek Aleksander Kolodziejczyk
2016 J jnl
Construction of models of bounded arithmetic by restricted reduced powers.
Arch. Math. Log.
Michal Garlík
2015 J jnl
A new proof of Ajtai's completeness theorem for nonstandard finite structures.
Arch. Math. Log.
Michal Garlík