Miltersen, Peter Bro ;
Reischuk, Rüdiger ;
Schnitger, Georg ;
van Melkebeek, Dieter
08381 Abstracts Collection -- Computational Complexity of Discrete Problems
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.
BibTeX - Entry
@InProceedings{miltersen_et_al:DSP:2008:1779,
author = {Peter Bro Miltersen and R{\"u}diger Reischuk and Georg Schnitger and Dieter van Melkebeek},
title = {08381 Abstracts Collection -- Computational Complexity of Discrete Problems},
booktitle = {Computational Complexity of Discrete Problems },
year = {2008},
editor = {Peter Bro Miltersen and R{\"u}diger Reischuk and Georg Schnitger and Dieter van Melkebeek},
number = {08381},
series = {Dagstuhl Seminar Proceedings},
ISSN = {1862-4405},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2008/1779},
annote = {Keywords: Computational complexity, discrete problems, Turing machines, circuits, proof complexity, pseudorandomness, derandomization, cryptography, }
}
|
Keywords: |
|
Computational complexity, discrete problems, Turing machines, circuits, proof complexity, pseudorandomness, derandomization, cryptography, |
|
Freie Schlagwörter (englisch): |
|
computational learning, communication complexity, query complexity, hardness of approximation |
|
Seminar: |
|
08381 - Computational Complexity of Discrete Problems
|
|
Issue date: |
|
2008 |
|
Date of publication: |
|
2008 |
2008
