Ján Pich

Available identifiers

Publication	Date of Publication	Type
Localizability of the approximation method	2024-10-25	Paper
Learning algorithms versus automatability of Frege systems	2024-06-24	Paper
Towards P$\ne$NP from Extended Frege lower bounds	2023-12-13	Paper
Strong co-nondeterministic lower bounds for NP cannot be proved feasibly	2023-11-14	Paper
Beyond Natural Proofs: Hardness Magnification and Locality	2023-04-27	Paper
https://portal.mardi4nfdi.de/entity/Q5875777	2023-02-03	Paper
Reasons for Hardness in QBF Proof Systems	2022-12-05	Paper
Hardness magnification near state-of-the-art lower bounds	2022-07-27	Paper
https://portal.mardi4nfdi.de/entity/Q5028364	2022-02-09	Paper
https://portal.mardi4nfdi.de/entity/Q5136303	2020-11-25	Paper
Frege Systems for Quantified Boolean Logic	2020-11-11	Paper
Feasibly constructive proofs of succinct weak circuit lower bounds	2019-11-22	Paper
Beyond Natural Proofs: Hardness Magnification and Locality	2019-11-19	Paper
Understanding Gentzen and Frege Systems for QBF	2018-04-23	Paper
Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic	2015-08-25	Paper
Circuit lower bounds in bounded arithmetics	2014-10-27	Paper
Nisan-Wigderson generators in proof systems with forms of interpolation	2011-09-27	Paper

This page was built for person: Ján Pich