EXCICO Extremal Combinatorics and Circuit Complexity
- Coordinator
- Matematicky Ustav Av Cr V.v.i., Czechia
- Runs
- 2 January 2024 to 1 January 2026
- Status
- Ended early
- EU funding
- €180k
- Total cost
- —
- Partners
- 2 organisations in 2 countries
- Type
- Marie Skłodowska-Curie Action
- Grant agreement
- 101106684
What the project is doing
In the project's own words, from its summary on CORDIS.
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 problem and in fact we will approach several such questions motivated by understanding the complexity of explicit Boolean functions. Our main objective look at circuit complexity through the lens of extremal combinatorics, a rich and vibrant of branch of combinatorics which studies objects satisfying various constraints. Therefore we aim to develop a systematic methodology which adopts tools of extremal combinatorics to tackle complexity problems.
More concretely we attack the problem of lower bounds for depth-3 circuits and specifically attempt to prove sharp lower bounds for the Majority function thus breaking a barrier in this area. We will further extend the techniques used in recent breakthrough on the Sunflower Conjecture and apply it to CNF formula and the structure of their satisfying assignments. We will our new insights on the structure of satisfying assignments to develop new improved algorithms for the satisfiability problem (SAT).
Topics
Who is involved
| Organisation | City | Country | Role |
|---|---|---|---|
| Matematicky Ustav Av Cr V.v.i. | Praha | Czechia | Coordinator |
| The Regents of the University of California | Oakland | United States | Associatedpartner |
Source: CORDIS, European Commission. Data of 5 Nov 2026, reused under the Commission's reuse policy. View on CORDIS · Grant DOI