Ján Pich

According to our database1, Ján Pich authored at least 9 papers between 2010 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Hardness Magnification near State-Of-The-Art Lower Bounds.
Proceedings of the 34th Computational Complexity Conference, 2019

2017
Feasibly constructive proofs of succinct weak circuit lower bounds.
Electronic Colloquium on Computational Complexity (ECCC), 2017

Reasons for Hardness in QBF Proof Systems.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2016
Understanding Gentzen and Frege Systems for QBF.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015
Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic.
Logical Methods in Computer Science, 2015

Circuit lower bounds in bounded arithmetics.
Ann. Pure Appl. Logic, 2015

2013
Circuit Lower Bounds in Bounded Arithmetics.
Electronic Colloquium on Computational Complexity (ECCC), 2013

2011
Nisan-Wigderson generators in proof systems with forms of interpolation.
Math. Log. Q., 2011

2010
Nisan-Wigderson generators in proof systems with forms of interpolation.
Electronic Colloquium on Computational Complexity (ECCC), 2010


  Loading...