DagRep.1.3.42.pdf
- Filesize: 0.95 MB
- 25 pages
Document
Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 1, Issue 3
Volume: Dagstuhl Reports, Volume 1
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2011-07-28
Cite As Get BibTex
Martin Grohe, Michal Koucky, Rüdiger Reischik, and Dieter van Melkebeek. Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121). In Dagstuhl Reports, Volume 1, Issue 3, pp. 42-66, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/DagRep.1.3.42
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 11121 ``Computational Complexity of Discrete Problems''. The first section gives an overview of the topics covered and the organization of the meeting. Section~2 lists the talks given in chronological order. The last section contains the abstracts of the talks.
Subject Classification
Keywords
- Discrete problems
- computational complexity
- Turing machines
- Boolean circuits
- quantum computing
- communication and query complexity
- extractors
- pseudorandomness
- derandomization
- approximation
- coding cryptography
- algorithmic learning
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads