Ján Pich

31 papers A* 5A 2Journal 23Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Learning algorithms from circuit lower bounds.
Comput. Complex.
Ján Pich
2024 A* conf
From Proof Complexity to Circuit Complexity via Interactive Protocols.
ICALP
Noel Arteche, Erfan Khaniki, Ján Pich, Rahul Santhanam
2024 J jnl
From Proof Complexity to Circuit Complexity via Interactive Protocols.
CoRR
Noel Arteche, Erfan Khaniki, Ján Pich, Rahul Santhanam
2024 J jnl
Localizability of the approximation method.
Comput. Complex.
Ján Pich
2023 J jnl
Towards P $\neq$ NP from Extended Frege Lower Bounds.
Electron. Colloquium Comput. Complex.
Ján Pich, Rahul Santhanam
2022 J jnl
Beyond Natural Proofs: Hardness Magnification and Locality.
J. ACM
Lijie Chen, Shuichi Hirahara, Igor Carboni Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam
2022 A* conf
Learning Algorithms Versus Automatability of Frege Systems.
ICALP
Ján Pich, Rahul Santhanam
2022 J jnl
Localizability of the approximation method.
CoRR
Ján Pich
2021 J jnl
Hardness Magnification Near State-of-the-Art Lower Bounds.
Theory Comput.
Igor C. Oliveira, Ján Pich, Rahul Santhanam
2021 J jnl
Learning algorithms versus automatability of Frege systems.
CoRR
Ján Pich, Rahul Santhanam
2021 A* conf
Strong co-nondeterministic lower bounds for NP cannot be proved feasibly.
STOC
Ján Pich, Rahul Santhanam
2020 A conf
Beyond Natural Proofs: Hardness Magnification and Locality.
ITCS
Lijie Chen, Shuichi Hirahara, Igor C. Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam
2020 J jnl
Feasibly constructive proofs of succinct weak circuit lower bounds.
Ann. Pure Appl. Log.
Moritz Müller, Ján Pich
2020 J jnl
Frege Systems for Quantified Boolean Logic.
J. ACM
Olaf Beyersdorff, Ilario Bonacina, Leroy Chew, Ján Pich
2020 J jnl
Learning algorithms from circuit lower bounds.
CoRR
Ján Pich
2020 J jnl
Reasons for Hardness in QBF Proof Systems.
ACM Trans. Comput. Theory
Olaf Beyersdorff, Luke Hinde, Ján Pich
2019 J jnl
Beyond Natural Proofs: Hardness Magnification and Locality.
CoRR
Lijie Chen, Shuichi Hirahara, Igor C. Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam
2019 J jnl
Beyond Natural Proofs: Hardness Magnification and Locality.
Electron. Colloquium Comput. Complex.
Igor Carboni Oliveira, Lijie Chen, Shuichi Hirahara, Ján Pich, Ninad Rajgopal, Rahul Santhanam
2019 A conf
Hardness Magnification near State-Of-The-Art Lower Bounds.
CCC
Igor Carboni Oliveira, Ján Pich, Rahul Santhanam
2019 A* conf
Why are Proof Complexity Lower Bounds Hard?
FOCS
Ján Pich, Rahul Santhanam
2018 J jnl
Hardness magnification near state-of-the-art lower bounds.
Electron. Colloquium Comput. Complex.
Igor Carboni Oliveira, Ján Pich, Rahul Santhanam
2017 J jnl
Feasibly constructive proofs of succinct weak circuit lower bounds.
Electron. Colloquium Comput. Complex.
Moritz Müller, Ján Pich
2017 — conf
Reasons for Hardness in QBF Proof Systems.
FSTTCS
Olaf Beyersdorff, Luke Hinde, Ján Pich
2017 J jnl
Reasons for Hardness in QBF Proof Systems.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Luke Hinde, Ján Pich
2016 A* conf
Understanding Gentzen and Frege Systems for QBF.
LICS
Olaf Beyersdorff, Ján Pich
2016 J jnl
Understanding Gentzen and Frege systems for QBF.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Ján Pich
2015 J jnl
Circuit lower bounds in bounded arithmetics.
Ann. Pure Appl. Log.
Ján Pich
2015 J jnl
Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic.
Log. Methods Comput. Sci.
Ján Pich
2013 J jnl
Circuit Lower Bounds in Bounded Arithmetics.
Electron. Colloquium Comput. Complex.
Ján Pich
2011 J jnl
Nisan-Wigderson generators in proof systems with forms of interpolation.
Math. Log. Q.
Ján Pich
2010 J jnl
Nisan-Wigderson generators in proof systems with forms of interpolation.
Electron. Colloquium Comput. Complex.
Ján Pich