Dagstuhl-Seminar 23111
Computational Complexity of Discrete Problems
( 12. Mar – 17. Mar, 2023 )
Permalink
Bitte benutzen Sie folgende Kurz-Url zum Verlinken dieser Seite:
https://www.dagstuhl.de/23111
Organisatoren
- Anna Gál (University of Texas - Austin, US)
- Meena Mahajan (The Institute of Mathematical Sciences - Chennai, IN)
- Rahul Santhanam (University of Oxford, GB)
- Till Tantau (Universität zu Lübeck, DE)
Kontakt
- Marsha Kleinbauer (für wissenschaftliche Fragen)
- Susanne Bach-Bernhard (für administrative Fragen)
Dagstuhl Reports
As part of the mandatory documentation, participants are asked to submit their talk abstracts, working group results, etc. for publication in our series Dagstuhl Reports via the Dagstuhl Reports Submission System.
- Upload (Use personal credentials as created in DOOR to log in)
Gemeinsame Dokumente
- Dagstuhl Materials Page (Use personal credentials as created in DOOR to log in)
Computational complexity studies the amount of resources (such as time, space, randomness, or communication) necessary to solve computational problems in various models of computation – a crucial task both in theoretical and practical applications. Despite a long line of research, for many practical problems it is not known if they can be solved efficiently. Here, “efficiently” can refer to polynomial-time algorithms, whose existence is not known for problems like Satisfiability or Factoring , but also to cubic or even quadratic time, where it would be important to establish whether these running times are best possible for basic problems, to what extent they can be improved, and whether parallel algorithms allow improvements of the runtime.
These fundamental questions motivate developments in areas from algorithm design to circuit complexity, communication complexity and proof complexity. The seminar’s topics will include new lower bounds on formula size and circuit size, complexity measures of Boolean functions, the algorithmic method for proving lower bounds, fixed-parameter tractability and hardness magnification, communication complexity and lifting techniques, as well as proof complexity. Continuing a long and successful series, this Dagstuhl Seminar will build on previous experience and retain the series’ distinctive features, while also capitalizing on new and exciting developments in the area such as the proof of the Sensitivity Conjecture, new lower bounds and results on matrix rigidity via the algorithmic method, and the remarkable success of lifting techniques in translating lower bounds from query complexity to communication complexity and from proof complexity to circuit complexity.
The bulk of the seminar will be taken up by talks and discussions. The topics will depend on and be driven by the participants, who will share their current research interests in talks, open problem sessions, and smaller group research.
Creative Commons BY 4.0
Anna Gál, Meena Mahajan, Rahul Santhanam, and Till Tantau
- Shyan Akmal (MIT - Cambridge, US) [dblp]
- Max Bannach (Universität zu Lübeck, DE) [dblp]
- Olaf Beyersdorff (Friedrich-Schiller-Universität Jena, DE) [dblp]
- Harry Buhrman (CWI - Amsterdam, NL) [dblp]
- Igor Carboni Oliveira (University of Warwick - Coventry, GB) [dblp]
- Gaia Carenini (ENS - Paris, FR) [dblp]
- Amit Chakrabarti (Dartmouth College - Hanover, US) [dblp]
- Sourav Chakraborty (Indian Statistical Institute - Kolkata, IN) [dblp]
- Gil Cohen (Tel Aviv University, IL) [dblp]
- Susanna de Rezende (Lund University, SE) [dblp]
- Yuval Filmus (Technion - Haifa, IL) [dblp]
- Anna Gál (University of Texas - Austin, US) [dblp]
- Mika Göös (EPFL Lausanne, CH) [dblp]
- Rohit Gurjar (Indian Institute of Technology - Mumbai, IN) [dblp]
- Kristoffer Arnsfelt Hansen (Aarhus University, DK) [dblp]
- Johan Hastad (KTH Royal Institute of Technology - Stockholm, SE) [dblp]
- Shuichi Hirahara (National Institute of Informatics - Tokyo, JP) [dblp]
- Rahul Ilango (MIT - Cambridge, US) [dblp]
- Swastik Kopparty (University of Toronto, CA) [dblp]
- Michal Koucký (Charles University - Prague, CZ) [dblp]
- Alexander S. Kulikov (JetBrains Research - Paphos, CY) [dblp]
- Marvin Künnemann (RPTU - Kaiserslautern, DE) [dblp]
- Sophie Laplante (Université Paris Cité, FR) [dblp]
- Zhenjian Lu (University of Oxford, GB) [dblp]
- Meena Mahajan (The Institute of Mathematical Sciences - Chennai, IN) [dblp]
- Jakob Nordström (University of Copenhagen, DK & Lund University, SE) [dblp]
- Manaswi Parashar (Aarhus University, DK) [dblp]
- Rüdiger Reischuk (Universität zu Lübeck, DE) [dblp]
- Robert Robere (McGill University - Montréal, CA) [dblp]
- Michael E. Saks (Rutgers University - Piscataway, US) [dblp]
- Rahul Santhanam (University of Oxford, GB) [dblp]
- Melanie Schmidt (Heinrich-Heine-Universität Düsseldorf, DE) [dblp]
- Amnon Ta-Shma (Tel Aviv University, IL) [dblp]
- Avishay Tal (University of California - Berkeley, US) [dblp]
- Till Tantau (Universität zu Lübeck, DE) [dblp]
- Thomas Thierauf (Hochschule Aalen, DE) [dblp]
- Jacobo Torán (Universität Ulm, DE) [dblp]
- Quinten Tupker (CWI - Amsterdam, NL)
- Ben Lee Volk (Reichman University - Herzliya, IL) [dblp]
Verwandte Seminare
- 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)
Klassifikation
- Computational Complexity
- Data Structures and Algorithms
Schlagworte
- computational complexity
- circuit complexity
- communication complexity
- randomness
- lower bounds
