Jn Pich
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
5
Venues
4
Active years
2016–2024
Best venue rank
A*
Where they publish
Papers
5 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2024 | ICALP | From Proof Complexity to Circuit Complexity via Interactive Protocols. | Noel Arteche, Erfan Khaniki, Jn Pich, Rahul Santhanam |
| 2022 | ICALP | Learning Algorithms Versus Automatability of Frege Systems. | Jn Pich, Rahul Santhanam |
| 2021 | STOC | Strong co-nondeterministic lower bounds for NP cannot be proved feasibly. | Jn Pich, Rahul Santhanam |
| 2019 | FOCS | Why are Proof Complexity Lower Bounds Hard? | Jn Pich, Rahul Santhanam |
| 2016 | LICS | Understanding Gentzen and Frege Systems for QBF. | Olaf Beyersdorff, Jn Pich |