Ján Pich

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 24

Top Topics

Complexity Theory

Top Venues

Electron. Colloquium Comput. Complex.

Ann. Pure Appl. Log.

Publications

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