DagSemProc.08381.1.pdf
- Filesize: 231 kB
- 18 pages
Document
08381 Abstracts Collection – Computational Complexity of Discrete Problems
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 8381
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2008-12-11
Cite AsGet BibTex
Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, and Dieter van Melkebeek. 08381 Abstracts Collection – Computational Complexity of Discrete Problems. In Computational Complexity of Discrete Problems. Dagstuhl Seminar Proceedings, Volume 8381, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/DagSemProc.08381.1
https://doi.org/10.4230/DagSemProc.08381.1
Abstract
From the 14th of September to the 19th of September, the Dagstuhl Seminar
08381 ``Computational Complexity of Discrete Problems'' was held in Schloss Dagstuhl - Leibniz Center for Informatics.
During the seminar, several participants presented their current
research, and ongoing work as well as open problems were discussed.
Abstracts of the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this report. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available.
Keywords
- Computational complexity
- discrete problems
- Turing machines
- circuits
- proof complexity
- pseudorandomness
- derandomization
- cryptography
- computational learning
- communication complexity
- query complexity
- hardness of approximation
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads