License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-17789
URL: http://drops.dagstuhl.de/opus/volltexte/2008/1778/
Go to the corresponding Portal


Miltersen, Peter Bro ; Reischuk, Rüdiger ; Schnitger, Georg ; van Melkebeek, Dieter

08381 Executive Summary -- Computational Complexity of Discrete Problems

pdf-format:
Document 1.pdf (103 KB)


Abstract

Estimating the computational complexity of discrete problems constitutes one of the central and classical topics in the theory of computation. Mathematicians and computer scientists have long tried to classify natural families of Boolean relations according to fundamental complexity measures like time and space, both in the uniform and in the nonuniform setting. Several models of computation have been developed in order to capture the various capabilities of digital computing devices, including parallelism, randomness, and quantum interference.

BibTeX - Entry

@InProceedings{miltersen_et_al:DSP:2008:1778,
  author =	{Peter Bro Miltersen and R{\"u}diger Reischuk and Georg Schnitger and Dieter van Melkebeek},
  title =	{08381 Executive Summary -- 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/1778},
  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: 11.12.2008


DROPS-Home | Fulltext Search | Imprint Published by LZI