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 explores computational complexity by examining Boolean functions and circuit complexity. It aims to develop new methodologies using extremal combinatorics to establish lower bounds for specific computational problems.
Computational complexity theory is the systematic study of computational problems in order to classify them in terms of their inherent logical hardness.
Several decades of research have not only given rise to important understanding of limits of computation, but have also developed algorithms which constitute a crucial part of modern life. A formidable challenge in complexity theory is to show non-linear lower bounds for an explicit Boolean function.
Our project is motivated by this fundamental…
MATEMATICKY USTAV AV CR V.V.I.
Partner organizations (coordinator is shown above), with normalized type and CORDIS activity type. Guests see up to 4 partners.
LOS ANGELES UCLA SANTA BARBARA UCSB DAVIS UCD RIVERSIDE UCR SAN DIEGO UCSD SANTA CRUZ UCSC IRVIN
United States, Berkeley
Type: University / higher education
Activity type: Higher or Secondary Education Establishments
SME: No
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.
