Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)when quoting this document, please refer to the following
DOI: 10.4230/DagRep.1.3.42
URN: urn:nbn:de:0030-drops-31935
URL: https://drops.dagstuhl.de/opus/volltexte/2011/3193/
Grohe, Martin ; Koucky, Michal ; Reischik, Rüdiger ; van Melkebeek, Dieter
Weitere Beteiligte (Hrsg. etc.): Martin Grohe and Michal Koucky and Rüdiger Reischuk and Dieter van Melkebeek
Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121)
| pdf-format: |
|
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar11121 ``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.
BibTeX - Entry
@Article{grohe_et_al:DR:2011:3193,
author = {Martin Grohe and Michal Koucky and R{\"u}diger Reischik and Dieter van Melkebeek},
title = {{Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121)}},
pages = {42--66},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2011},
volume = {1},
number = {3},
editor = {Martin Grohe and Michal Koucky and R{\"u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3193},
URN = {urn:nbn:de:0030-drops-31935},
doi = {10.4230/DagRep.1.3.42},
annote = {Keywords: Discrete problems, computational complexity, Turing machines, Boolean circuits, quantum computing, communication and query complexity, extractors, }
}
| Keywords: | Discrete problems, computational complexity, Turing machines, Boolean circuits, quantum computing, communication and query complexity, extractors, | |
| Freie Schlagwörter (englisch): | pseudorandomness, derandomization, approximation, coding cryptography, algorithmic learning | |
| Seminar: | Dagstuhl Reports, Volume 1, Issue 3 | |
| Issue date: | 2011 | |
| Date of publication: | 28.07.2011 |
