Folgen
Ján Pich
Ján Pich
Bestätigte E-Mail-Adresse bei cs.ox.ac.uk - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Hardness magnification near state-of-the-art lower bounds
IC Oliveira, J Pich, R Santhanam
https://eccc.weizmann.ac.il/report/2018/158/, 2018
502018
Beyond natural proofs: Hardness magnification and locality
L Chen, S Hirahara, IC Oliveira, J Pich, N Rajgopal, R Santhanam
ACM Journal of the ACM (JACM) 69 (4), 1-49, 2022
412022
Feasibly constructive proofs of succinct weak circuit lower bounds
M Müller, J Pich
Annals of Pure and Applied Logic, 2019
342019
Reasons for hardness in QBF proof systems
O Beyersdorff, L Hinde, J Pich
ACM Transactions on Computation Theory (TOCT) 12 (2), 1-27, 2020
282020
Understanding Gentzen and Frege systems for QBF
O Beyersdorff, J Pich
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016
272016
Circuit lower bounds in bounded arithmetics
J Pich
Annals of Pure and Applied Logic 166 (1), 29-45, 2015
252015
Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic
J Pich
Logical Methods in Computer Science 11 (2), 2015
192015
Frege systems for quantified Boolean logic
O Beyersdorff, I Bonacina, L Chew, J Pich
Journal of the ACM (JACM) 67 (2), 1-36, 2020
182020
Why are proof complexity lower bounds hard?
J Pich, R Santhanam
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
162019
Strong co-nondeterministic lower bounds for NP cannot be proved feasibly
J Pich, R Santhanam
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
102021
Nisan‐Wigderson generators in proof systems with forms of interpolation
J Pich
Mathematical Logic Quarterly 57 (4), 379-383, 2011
92011
Complexity theory in feasible mathematics
J Pich
Charles University in Prague, 2014
82014
Learning algorithms from circuit lower bounds
J Pich
arXiv preprint arXiv:2012.14095, 2020
62020
Learning algorithms versus automatability of Frege systems
J Pich, R Santhanam
arXiv preprint arXiv:2111.10626, 2021
42021
A note on natural proofs and intuitionism
K Ghasemloo, J Pich
available at karlin. mff. cuni. cz/∼ pich/natcons. pdf, 2013
32013
Hard tautologies
J Pich
Charles University in Prague, 2011
22011
Towards PNP from Extended Frege lower bounds
J Pich, R Santhanam
arXiv preprint arXiv:2312.08163, 2023
12023
Localizability of the approximation method
J Pich
arXiv preprint arXiv:2212.09285, 2022
12022
Provability of weak circuit lower bounds
M Müller, J Pich
unpublished, available from the second author’s homepage, 2017
12017
From Proof Complexity to Circuit Complexity via Interactive Protocols
N Arteche, E Khaniki, J Pich, R Santhanam
arXiv preprint arXiv:2405.02232, 2024
2024
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20