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 fundamental questions in theoretical computer science regarding computational problem complexity. It aims to establish intractability for algebraic problems and improve algorithms for Polynomial Identity Testing, pushing the boundaries of current knowledge in algorithm design.
Does efficient verification imply efficient search?
Can randomness provide massive speed-ups in computation?
These are fundamental questions in theoretical computer science, known as P vs. NP and P vs. BPP respectively.
Progress on these questions requires us to to show that certain computational problems are inherently intractable, i.e. do not admit efficient solutions.
An important, and concrete, approach to such questions is to understand the complexity of algebraic problems such as the Deter…
KOBENHAVNS UNIVERSITET
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 topics.
Guests see up to 5 keywords.
