Dagstuhl Seminar 28111
Computational Complexity of Discrete Problems
( Mar 12 – Mar 17, 2028 )
Permalink
Please use the following short url to reference this page:
https://www.dagstuhl.de/28111
Organizers
- Swastik Kopparty (University of Toronto, CA)
- Meena Mahajan (The Institute of Mathematical Sciences - Chennai, IN)
- Rahul Santhanam (University of Oxford, GB)
- Amnon Ta-Shma (Tel Aviv University, IL)
Contact
- Marsha Kleinbauer (for scientific matters)
- Susanne Bach-Bernhard (for administrative matters)
Computational complexity aims to understand the precise limits of efficient computation, across a spectrum of computational models (circuits, Turing machines, random-access machines, communication channels, ...), modes of computation (deterministic, randomized, nondeterministic, interactive, ...), and constraints on resources (time, space, queries, ...). Key to this understanding is establishing lower bounds, showing that a certain amount of a resource is necessary for solving the problem at hand. An equally important aspect is devising algorithms that can simulate or trade off one kind of resource for another while exploiting the inherent structure of the problem, providing upper bounds in multiple settings.
In the Dagstuhl Seminar, we will address several of the arising questions in the context of circuit complexity, meta-complexity, proof complexity, communication complexity, derandomization, codes, combinatorial constructions, and other topics in computational complexity. In each area, powerful tools for proving lower and upper bounds are known, drawing on the richness of tools and methods from many sub-areas of mathematics. Particularly interesting and powerful results often arise from establishing connections across areas, and linking the posed questions. By bringing together a diverse group of leading experts and promising young researchers in these areas, the seminar will be an ideal place to discover further connections and to make advances.
Creative Commons BY 4.0
Swastik Kopparty, Meena Mahajan, Rahul Santhanam, and Amnon Ta-Shma
Related Seminars
- Dagstuhl Seminar 9235: Complexity and Realization of Boolean Functions (1992-08-24 - 1992-08-28) (Details)
- Dagstuhl Seminar 9711: Complexity of Boolean Functions (1997-03-10 - 1997-03-14) (Details)
- Dagstuhl Seminar 99441: Complexity of Boolean Functions (1999-10-31 - 1999-11-05) (Details)
- Dagstuhl Seminar 02121: Complexity of Boolean Functions (2002-03-17 - 2002-03-22) (Details)
- Dagstuhl Seminar 04141: Complexity of Boolean Functions (2004-03-28 - 2004-04-02) (Details)
- Dagstuhl Seminar 06111: Complexity of Boolean Functions (2006-03-12 - 2006-03-17) (Details)
- Dagstuhl Seminar 08381: Computational Complexity of Discrete Problems (2008-09-14 - 2008-09-19) (Details)
- Dagstuhl Seminar 11121: Computational Complexity of Discrete Problems (2011-03-20 - 2011-03-25) (Details)
- Dagstuhl Seminar 14121: Computational Complexity of Discrete Problems (2014-03-16 - 2014-03-21) (Details)
- Dagstuhl Seminar 17121: Computational Complexity of Discrete Problems (2017-03-19 - 2017-03-24) (Details)
- Dagstuhl Seminar 19121: Computational Complexity of Discrete Problems (2019-03-17 - 2019-03-22) (Details)
- Dagstuhl Seminar 21121: Computational Complexity of Discrete Problems (2021-03-21 - 2021-03-26) (Details)
- Dagstuhl Seminar 23111: Computational Complexity of Discrete Problems (2023-03-12 - 2023-03-17) (Details)
- Dagstuhl Seminar 25111: Computational Complexity of Discrete Problems (2025-03-09 - 2025-03-14) (Details)
Classification
- Computational Complexity
Keywords
- computational complexity
- circuit complexity
- communication complexity
- randomness
- lower bounds
