Metacomputational Complexity Theory
Sector: Education • Location: United Kingdom
Source: EU Funding & Tenders Portal
The goal of the project is to advance our understanding of the central questions in Computational Complexity Theory such as the famous P versus NP problem. Complexity Theory approaches questions about efficiency of computation by investigating lower and upper bounds on the complexity of concrete computational models such as Boolean circuits or propositional proof systems. Unfortunately, even afte
- Status
- Closed
- Sector
- Education, Cement
- Location
- United Kingdom
- Updated
- 22 Jul 2026
- Source
- EU Funding & Tenders Portal
ConstructChat
Ask ConstructChat about Metacomputational Complexity Theory
Pick a question to edit it, or write your own.
First answer free · no account
Project Information FAQ
Project Information
Participants
| Not available for this record. |
Status
Original status | ended |
Taiyo status | Closed |
Taiyo last update | 2026-07-22 |
Contact
| Not available for this record. |
Description
Description | The goal of the project is to advance our understanding of the central questions in Computational Complexity Theory such as the famous P versus NP problem. Complexity Theory approaches questions about efficiency of computation by investigating lower and upper bounds on the complexity of concrete computational models such as Boolean circuits or propositional proof systems. Unfortunately, even after several decades of intense research the progress on the question of proving strong complexity lower bounds remains very incremental. In fact, several significant barrier results have been discovered, partially explaining the complexity of establishing complexity lower bounds. While the barrier results presented a serious obstacle they also revealed new structural properties of complexity lower bounds connecting lower bounds to the construction of efficient learning algorithms, cryptography or independence results in mathematical logic. The present project continues the development of these structural connections and complexity-theoretic properties of problems about complexity, which we shortly refer to as Metacomputational Complexity Theory. The objectives of the project can be divided into two groups. 1. Hardness magnification, exploring limits and consequences of an emerging theory of hardness magnification which arouse recently from investigations of metacomputational aspects of circuit lower bounds and received a lot of attention as a promising approach overcoming previously existing barriers for proving complexity lower bounds. 2. Structural theory, strengthening and generalizing connections between the methods for proving lower bounds and other central concepts of computer science, such as efficient learning algorithms, cryptographic primitives and automatizability of propositional proof systems, through the lens of mathematical logic. |
Location
Country | United Kingdom (UK) |
Source
Source | EU Funding & Tenders Portal |
URL |
More Details
Record type | Project |
Sector | Education, Cement |
Article published date | 2026-02-15 |
Research
Free account
View all details
You are reading the public part. A free account opens the rest:
- Every detail on this project
- News and media coverage
- Technical research
Free account · no card · lands you back on this project
More Education projects in United Kingdom
- RAF Fairford
- Fish Food & Business Park, Fleetwood
- Coca Cola Bottling Plant, Wakefield, England
- Michael Uren Biomedical Engineering Research Hub, London
- Core Technology Facility, University Of Manchester, Manchester
- Pukka Pies
- The Francis Crick Institute, London
- The Pears Building, Royal Free Hospital, London, UK
