We stand with Ukraine  

Ján Pich

Orcid: 0000-0002-2731-1330

Affiliations:
  • University of Oxford, UK


According to our database1, Ján Pich authored at least 15 papers between 2011 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Towards P $\neq$ NP from Extended Frege Lower Bounds.
[BibTeX]
[DOI]
Ján Pich
,
Rahul Santhanam
Electron. Colloquium Comput. Complex., 2023

2022
Beyond Natural Proofs: Hardness Magnification and Locality.
[BibTeX]
[DOI]
Lijie Chen
,
Shuichi Hirahara
,
Igor Carboni Oliveira
,
Ján Pich
,
Ninad Rajgopal
,
Rahul Santhanam
J. ACM, 2022

Localizability of the approximation method.
[BibTeX]
[DOI]
Ján Pich
CoRR, 2022

Learning Algorithms Versus Automatability of Frege Systems.
[BibTeX]
[DOI]
Ján Pich
,
Rahul Santhanam
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Hardness Magnification Near State-of-the-Art Lower Bounds.
[BibTeX]
[DOI]
Igor C. Oliveira
,
Ján Pich
,
Rahul Santhanam
Theory Comput., 2021

Strong co-nondeterministic lower bounds for NP cannot be proved feasibly.
[BibTeX]
[DOI]
Ján Pich
,
Rahul Santhanam
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2020
Frege Systems for Quantified Boolean Logic.
[BibTeX]
[DOI]
Olaf Beyersdorff
,
Ilario Bonacina
,
Leroy Chew
,
Ján Pich
J. ACM, 2020

Learning algorithms from circuit lower bounds.
[BibTeX]
[DOI]
Ján Pich
CoRR, 2020

2019
Why are Proof Complexity Lower Bounds Hard?
[BibTeX]
[DOI]
Ján Pich
,
Rahul Santhanam
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2017
Feasibly constructive proofs of succinct weak circuit lower bounds.
[BibTeX]
[DOI]
Moritz Müller
,
Ján Pich
Electron. Colloquium Comput. Complex., 2017

Reasons for Hardness in QBF Proof Systems.
[BibTeX]
[DOI]
Olaf Beyersdorff
,
Luke Hinde
,
Ján Pich
Electron. Colloquium Comput. Complex., 2017

2016
Understanding Gentzen and Frege systems for QBF.
[BibTeX]
[DOI]
Olaf Beyersdorff
,
Ján Pich
Electron. Colloquium Comput. Complex., 2016

2015
Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic.
[BibTeX]
[DOI]
Ján Pich
Log. Methods Comput. Sci., 2015

2013
Circuit Lower Bounds in Bounded Arithmetics.
[BibTeX]
[DOI]
Ján Pich
Electron. Colloquium Comput. Complex., 2013

2011
Nisan-Wigderson generators in proof systems with forms of interpolation.
[BibTeX]
[DOI]
Ján Pich
Math. Log. Q., 2011


  Loading...