Metacomputational Complexity Theory

Project Information

MCT

Grant agreement ID: 890220

DOI 10.3030/890220

Project closed

EC signature date 20 February 2020

Start date 1 March 2020

End date 28 February 2022

Funded under

• EXCELLENT SCIENCE - Marie Skłodowska-Curie Actions

Total cost € 212 933,76

EU contribution € 212 933,76

Coordinated by

THE CHANCELLOR, MASTERS AND SCHOLARS OF THE UNIVERSITY OF OXFORD
United Kingdom

Publications

Other (3)

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

Peer reviewed articles (1)

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

Conference proceedings (1)

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