Seminar Homepage : Druckversion


http://www.dagstuhl.de/17121

19. – 24. März 2017, Dagstuhl Seminar 17121

Computational Complexity of Discrete Problems

Organisatoren

Anna Gál (University of Texas – Austin, US)
Michal Koucký (Charles University – Prague, CZ)
Oded Regev (New York University, US)
Till Tantau (Universität zu Lübeck, DE)

Auskunft zu diesem Dagstuhl Seminar erteilt

Dagstuhl Service Team

Dokumente

Dagstuhl Report, Volume 7, Issue 3 Dagstuhl Report
Motivationstext
Teilnehmerliste
Gemeinsame Dokumente
Dagstuhl's Impact: Dokumente verfügbar
Programm des Dagstuhl Seminars [pdf]

Summary

Introduction and goals

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 and becomes even more important with the use of computers becoming part of everyday life. 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, or to what extent they can be improved.

These fundamental questions motivate developments in various areas from algorithm design to circuit complexity, communication complexity and coding theory. During this Dagstuhl Seminar, we discussed some of the most exciting recent developments in those areas related to computational complexity.

The seminar "Computational Complexity of Discrete Problems" has evolved out of the series of seminars entitled "Complexity of Boolean Functions," a topic that has been covered at Dagstuhl on a regular basis since the foundation of this research center. An important feature of the current research in computational complexity is the integration of ideas from different subareas of computational complexity and from other fields in computer science and mathematics. We have aimed to attract researchers from various subareas connected to core questions in boolean function complexity and foster further fruitful interactions.

License
  Creative Commons BY 3.0 Unported license
  Anna Gál, Michal Koucký, Oded Regev, and Till Tantau

Dagstuhl Seminar Series

Classification

Keywords



Buchausstellung

Bücher der Teilnehmer 

Buchausstellung im Erdgeschoss der Bibliothek

(nur in der Veranstaltungswoche).

Dokumentation

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).

Publikationen

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.


Seminar Homepage : Letzte Änderung 11.12.2017, 23:43 Uhr