European Commission logo
English English
CORDIS - EU research results
CORDIS

Metacomputational Complexity Theory

Publications

Learning algorithms versus automatability of Frege systems

Author(s): Jan Pich, Rahul Santhanam
Published in: ArXiv (to appear in International Colloquium on Automata, Languages and Programming ICALP 2022), 2021
Publisher: ArXiv

Learning algorithms from circuit lower bounds

Author(s): Jan Pich
Published in: ArXiv, 2020
Publisher: ArXiv

Beyond natural proofs: hardness magnification and locality

Author(s): Lijie Chen, Shuichi Hirahara, Igor C. Oliveira, Jan Pich, Ninad Rajgopal, Rahul Santhanam
Published in: Journal of the ACM (to appear), 2022
Publisher: ACM

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

Author(s): Igor Carboni Oliveira, Jan Pich, Rahul Santhanam
Published in: Theory of Computing, 2021
Publisher: Theory of Computing

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

Author(s): Jan Pich, Rahul Santhanam
Published in: Proceedings of the 53rd ACM SIGACT Symposium on Theory of Computing, 2021
Publisher: ACM

Searching for OpenAIRE data...

There was an error trying to search data from OpenAIRE

No results available