@Article{grohe_et_al:DagRep.1.3.42,
author = {Grohe, Martin and Koucky, Michal and Reischik, R\"{u}diger and van Melkebeek, Dieter},
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 = {Grohe, Martin and Koucky, Michal and Reischik, R\"{u}diger and van Melkebeek, Dieter},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.3.42},
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, pseudorandomness, derandomization, approximation, coding cryptography, algorithmic learning}
}