CORDIS Project
Funding breakdown and partner intelligence are Premium
Sign in and upgrade to Premium for EU contribution totals, consortium analytics, OpenAlex research context, and AI summaries. · 0 consortium intelligence fields visible of 1
Start free • Cancel anytime • 14-day refund guarantee
This project investigates the P vs NP question in computer science by exploring lower bounds in computational and proof complexity using a framework called meta-complexity. It aims to establish connections between these fields and apply findings to areas like theoretical cryptography and learning.
One of the most fundamental questions in computer science is the P vs NP question, which asks if every computational problem with efficiently verifiable solutions is efficiently solvable.
Equivalently, it asks if all propositional tautologies have proofs that can be found efficiently.
The answer is widely believed to be negative, but we lack a rigorous justification for this belief.
The field of computational complexity approaches P vs NP and related questions by showing lower bounds (i.e., impo…
THE CHANCELLOR, MASTERS AND SCHOLARS OF THE UNIVERSITY OF OXFORD
Partner organizations (coordinator is shown above), with normalized type and CORDIS activity type. Guests see up to 4 partners.
Similar projects, consortium collaboration history, frequent partners, and OpenAlex research context.
Guests see up to 5 EuroSciVoc fields.
Guests see up to 5 topics.
Guests see up to 5 keywords.
