Nisan-Wigderson generators in proof systems with forms of interpolation. - Ján Pich (Electron. Colloquium Comput. Complex., 2010)

Circuit Lower Bounds in Bounded Arithmetics. - Ján Pich (Electron. Colloquium Comput. Complex., 2013)

Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic. - Ján Pich (Log. Methods Comput. Sci., 2015)

Understanding Gentzen and Frege systems for QBF. - Olaf Beyersdorff; Ján Pich (Electron. Colloquium Comput. Complex., 2016)

Reasons for Hardness in QBF Proof Systems. - Olaf Beyersdorff; Luke Hinde; Ján Pich (Electron. Colloquium Comput. Complex., 2017)

Feasibly constructive proofs of succinct weak circuit lower bounds. - Moritz Müller; Ján Pich (Electron. Colloquium Comput. Complex., 2017)

Hardness magnification near state-of-the-art lower bounds. - Igor Carboni Oliveira; Ján Pich; Rahul Santhanam (Electron. Colloquium Comput. Complex., 2018)

Why are Proof Complexity Lower Bounds Hard? - Ján Pich; Rahul Santhanam (FOCS, 2019)

Beyond Natural Proofs: Hardness Magnification and Locality. - Igor Carboni Oliveira; Lijie Chen 001; Shuichi Hirahara; Ján Pich; Ninad Rajgopal; Rahul Santhanam (Electron. Colloquium Comput. Complex., 2019)

Frege Systems for Quantified Boolean Logic. - Olaf Beyersdorff; Ilario Bonacina; Leroy Chew; Ján Pich (J. ACM, 2020)

Strong co-nondeterministic lower bounds for NP cannot be proved feasibly. - Ján Pich; Rahul Santhanam (STOC, 2021)

Learning Algorithms Versus Automatability of Frege Systems. - Ján Pich; Rahul Santhanam (ICALP, 2022)

Towards P $ neq$ NP from Extended Frege Lower Bounds. - Ján Pich; Rahul Santhanam (Electron. Colloquium Comput. Complex., 2023)

From Proof Complexity to Circuit Complexity via Interactive Protocols. - Noel Arteche; Erfan Khaniki; Ján Pich; Rahul Santhanam (ICALP, 2024)

Localizability of the approximation method. - Ján Pich (Comput. Complex., 2024)

Learning algorithms from circuit lower bounds. - Ján Pich (Comput. Complex., 2025)