Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH scholarly article en Miltersen, Peter Bro; Reischuk, Rüdiger; Schnitger, Georg; van Melkebeek, Dieter License
when quoting this document, please refer to the following
DOI:
URN: none
URL:

; ; ;

08381 Abstracts Collection -- Computational Complexity of Discrete Problems

pdf-format:


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:DagSemProc.08381.1,
  author =	{Miltersen, Peter Bro and Reischuk, R\"{u}diger and Schnitger, Georg and van Melkebeek, Dieter},
  title =	{{08381 Abstracts Collection – Computational Complexity of Discrete Problems}},
  booktitle =	{Computational Complexity of Discrete Problems},
  pages =	{1--18},
  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/opus/volltexte/2008/1779},
  URN =		{none},
  doi =		{10.4230/DagSemProc.08381.1},
  annote =	{Keywords: Computational complexity, discrete problems, Turing machines, circuits, proof complexity, pseudorandomness, derandomization, cryptography, computational learning, communication complexity, query complexity, hardness of approximation}
}

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: 11.12.2008


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI