Skip to main content
European Commission logo
español español
CORDIS - Resultados de investigaciones de la UE
CORDIS
CORDIS Web 30th anniversary CORDIS Web 30th anniversary

Metacomputational Complexity Theory

Publicaciones

Learning algorithms versus automatability of Frege systems

Autores: Jan Pich, Rahul Santhanam
Publicado en: ArXiv (to appear in International Colloquium on Automata, Languages and Programming ICALP 2022), 2021
Editor: ArXiv

Learning algorithms from circuit lower bounds

Autores: Jan Pich
Publicado en: ArXiv, 2020
Editor: ArXiv

Beyond natural proofs: hardness magnification and locality

Autores: Lijie Chen, Shuichi Hirahara, Igor C. Oliveira, Jan Pich, Ninad Rajgopal, Rahul Santhanam
Publicado en: Journal of the ACM (to appear), 2022
Editor: ACM

Hardness magnification near state-of-the-art lower bounds

Autores: Igor Carboni Oliveira, Jan Pich, Rahul Santhanam
Publicado en: Theory of Computing, 2021
Editor: Theory of Computing

Strong co-Nondeterministic lower bounds for NP cannot be proved feasibly

Autores: Jan Pich, Rahul Santhanam
Publicado en: Proceedings of the 53rd ACM SIGACT Symposium on Theory of Computing, 2021
Editor: ACM

Buscando datos de OpenAIRE...

Se ha producido un error en la búsqueda de datos de OpenAIRE

No hay resultados disponibles