@InProceedings{miltersen_et_al:DagSemProc.08381.2,
author = {Miltersen, Peter Bro and Reischuk, R\"{u}diger and Schnitger, Georg and van Melkebeek, Dieter},
title = {{08381 Executive Summary – Computational Complexity of Discrete Problems}},
booktitle = {Computational Complexity of Discrete Problems},
pages = {1--7},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2008},
volume = {8381},
editor = {Peter Bro Miltersen and R\"{u}diger Reischuk and Georg Schnitger and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08381.2},
URN = {urn:nbn:de:0030-drops-17789},
doi = {10.4230/DagSemProc.08381.2},
annote = {Keywords: Computational complexity, discrete problems, Turing machines, circuits, proof complexity, pseudorandomness, derandomization, cryptography, computational learning, communication complexity, query complexity, hardness of approximation}
}