default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJán Pich
Person information
- affiliation: University of Oxford, UK
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Ján Pich:
Localizability of the approximation method. Comput. Complex. 33(2): 12 (2024)- [c8]Noel Arteche, Erfan Khaniki, Ján Pich, Rahul Santhanam
:
From Proof Complexity to Circuit Complexity via Interactive Protocols. ICALP 2024: 12:1-12:20 - [i13]Noel Arteche, Erfan Khaniki, Ján Pich, Rahul Santhanam:
From Proof Complexity to Circuit Complexity via Interactive Protocols. CoRR abs/2405.02232 (2024) - 2023
- [i12]Ján Pich, Rahul Santhanam:
Towards P $\neq$ NP from Extended Frege Lower Bounds. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j8]Lijie Chen, Shuichi Hirahara, Igor Carboni Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. J. ACM 69(4): 25:1-25:49 (2022) - [c7]Ján Pich, Rahul Santhanam:
Learning Algorithms Versus Automatability of Frege Systems. ICALP 2022: 101:1-101:20 - [i11]Ján Pich:
Localizability of the approximation method. CoRR abs/2212.09285 (2022) - 2021
- [j7]Igor C. Oliveira, Ján Pich, Rahul Santhanam:
Hardness Magnification Near State-of-the-Art Lower Bounds. Adv. Math. Commun. 17: 1-38 (2021) - [c6]Ján Pich, Rahul Santhanam:
Strong co-nondeterministic lower bounds for NP cannot be proved feasibly. STOC 2021: 223-233 - [i10]Ján Pich, Rahul Santhanam:
Learning algorithms versus automatability of Frege systems. CoRR abs/2111.10626 (2021) - 2020
- [j6]Moritz Müller, Ján Pich:
Feasibly constructive proofs of succinct weak circuit lower bounds. Ann. Pure Appl. Log. 171(2) (2020) - [j5]Olaf Beyersdorff, Ilario Bonacina, Leroy Chew, Ján Pich:
Frege Systems for Quantified Boolean Logic. J. ACM 67(2): 9:1-9:36 (2020) - [j4]Olaf Beyersdorff, Luke Hinde, Ján Pich:
Reasons for Hardness in QBF Proof Systems. ACM Trans. Comput. Theory 12(2): 10:1-10:27 (2020) - [c5]Lijie Chen, Shuichi Hirahara, Igor C. Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. ITCS 2020: 70:1-70:48 - [i9]Ján Pich:
Learning algorithms from circuit lower bounds. CoRR abs/2012.14095 (2020)
2010 – 2019
- 2019
- [c4]Igor Carboni Oliveira, Ján Pich, Rahul Santhanam:
Hardness Magnification near State-Of-The-Art Lower Bounds. CCC 2019: 27:1-27:29 - [c3]Ján Pich, Rahul Santhanam:
Why are Proof Complexity Lower Bounds Hard? FOCS 2019: 1305-1324 - [i8]Lijie Chen, Shuichi Hirahara, Igor C. Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. CoRR abs/1911.08297 (2019) - [i7]Igor Carboni Oliveira, Lijie Chen, Shuichi Hirahara, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [i6]Igor Carboni Oliveira, Ján Pich, Rahul Santhanam:
Hardness magnification near state-of-the-art lower bounds. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c2]Olaf Beyersdorff, Luke Hinde, Ján Pich:
Reasons for Hardness in QBF Proof Systems. FSTTCS 2017: 14:1-14:15 - [i5]Olaf Beyersdorff, Luke Hinde, Ján Pich:
Reasons for Hardness in QBF Proof Systems. Electron. Colloquium Comput. Complex. TR17 (2017) - [i4]Moritz Müller, Ján Pich:
Feasibly constructive proofs of succinct weak circuit lower bounds. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c1]Olaf Beyersdorff, Ján Pich:
Understanding Gentzen and Frege Systems for QBF. LICS 2016: 146-155 - [i3]Olaf Beyersdorff, Ján Pich:
Understanding Gentzen and Frege systems for QBF. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j3]Ján Pich:
Circuit lower bounds in bounded arithmetics. Ann. Pure Appl. Log. 166(1): 29-45 (2015) - [j2]Ján Pich:
Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic. Log. Methods Comput. Sci. 11(2) (2015) - 2013
- [i2]Ján Pich:
Circuit Lower Bounds in Bounded Arithmetics. Electron. Colloquium Comput. Complex. TR13 (2013) - 2011
- [j1]Ján Pich:
Nisan-Wigderson generators in proof systems with forms of interpolation. Math. Log. Q. 57(4): 379-383 (2011) - 2010
- [i1]Ján Pich:
Nisan-Wigderson generators in proof systems with forms of interpolation. Electron. Colloquium Comput. Complex. TR10 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-12 20:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
