Ján Pich

Circuit lower bounds in bounded arithmetics

Ján Pich, J. Pich, 2013, Ann. Pure Appl. Log..

Understanding Gentzen and Frege Systems for QBF

Olaf Beyersdorff, Ján Pich, Olaf Beyersdorff, 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

Nisan-Wigderson generators in proof systems with forms of interpolation

Ján Pich, 2011, Math. Log. Q..

Hardness magnification near state-of-the-art lower bounds

Igor Carboni Oliveira, Rahul Santhanam, Ján Pich, 2019, Electron. Colloquium Comput. Complex..

Feasibly constructive proofs of succinct weak circuit lower bounds

Moritz Müller, Ján Pich, M. Müller, 2020, Electron. Colloquium Comput. Complex..

Reasons for Hardness in QBF Proof Systems

Olaf Beyersdorff, Ján Pich, Luke Hinde, 2018, Electron. Colloquium Comput. Complex..

Reasons for Hardness in QBF Proof Systems

Olaf Beyersdorff, Ján Pich, Luke Hinde, 2020, ACM Trans. Comput. Theory.

Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic

Ján Pich, J. Pich, 2014, Log. Methods Comput. Sci..

Strong co-nondeterministic lower bounds for NP cannot be proved feasibly

Rahul Santhanam, Ján Pich, R. Santhanam, 2021, STOC.