17. – 22. März 2019, Dagstuhl-Seminar 19121

Computational Complexity of Discrete Problems


Anna Gál (University of Texas – Austin, US)
Oded Regev (New York University, US)
Rahul Santhanam (University of Oxford, GB)
Till Tantau (Universität zu Lübeck, DE)

Auskunft zu diesem Dagstuhl-Seminar erteilen

Jutka Gasiorowski zu administrativen Fragen

Andreas Dolzmann zu wissenschaftlichen Fragen


Computational complexity studies the amount of resources (such as time, space, randomness, or communication) that are necessary to solve computational problems in various models of computation. Finding efficient algorithms for solving computational tasks is crucial for practical applications. Despite a long line of research, for many problems that arise in practice it is not known if they can be solved efficiently – in particular in polynomial time. Beside questions about the existence of polynomial time algorithms for problems like Satisfiability or Factoring, where the best known algorithms run in exponential time, there is a huge class of practical problems where algorithms with polynomial running time (e.g. cubic or even quadratic time) are known, but it would be important to establish whether these running times are best possible, to what extent they can be improved, and whether parallel algorithms allow improvements of the runtime.

These fundamental questions motivate developments in various areas from algorithm design to circuit complexity, communication complexity and coding theory. During this Dagstuhl Seminar, we plan to discuss some of the most exciting recent developments in those areas related to computational 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. The list of topics will include – but not be limited to – subjects such as formula size – especially new results on lower bounds –, complexity measures of Boolean functions, lower bounds for algorithm runtimes arising from connections to Satisfiability problems, the relationship of circuit complexity and fixed parameter tractability, communication complexity, as well as deep learning and circuit complexity.

The seminar is a continuation of the series of Dagstuhl Seminars entitled “Computational Complexity of Discrete Problems” and formerly “Complexity of Boolean Functions.” It will build on the long experience and focus on what has made the series strong in the past: bringing together the leading experts and the exceptionally talented junior researchers to discuss the most exciting recent developments in different areas of computational complexity of discrete problems – both regarding recent results, but also regarding open problems.

  Creative Commons BY 3.0 DE
  Anna Gál, Oded Regev, Rahul Santhanam, and Till Tantau

Dagstuhl-Seminar Series


  • Data Structures / Algorithms / Complexity


  • Computational complexity
  • Circuit complexity
  • Communication complexity
  • Randomness
  • Parametrisation


Bücher der Teilnehmer 

Buchausstellung im Erdgeschoss der Bibliothek

(nur in der Veranstaltungswoche).


In der Reihe Dagstuhl Reports werden alle Dagstuhl-Seminare und Dagstuhl-Perspektiven-Workshops dokumentiert. Die Organisatoren stellen zusammen mit dem Collector des Seminars einen Bericht zusammen, der die Beiträge der Autoren zusammenfasst und um eine Zusammenfassung ergänzt.


Download Übersichtsflyer (PDF).


Es besteht weiterhin die Möglichkeit, eine umfassende Kollektion begutachteter Arbeiten in der Reihe Dagstuhl Follow-Ups zu publizieren.

Dagstuhl's Impact

Bitte informieren Sie uns, wenn eine Veröffentlichung ausgehend von
Ihrem Seminar entsteht. Derartige Veröffentlichungen werden von uns in der Rubrik Dagstuhl's Impact separat aufgelistet  und im Erdgeschoss der Bibliothek präsentiert.