Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121)

Authors Martin Grohe, Michal Koucky, Rüdiger Reischik, Dieter van Melkebeek and all authors of the abstracts in this report



PDF
Thumbnail PDF

File

DagRep.1.3.42.pdf
  • Filesize: 0.95 MB
  • 25 pages

Document Identifiers

Author Details

Martin Grohe
Michal Koucky
Rüdiger Reischik
Dieter van Melkebeek
and all authors of the abstracts in this report

Cite AsGet BibTex

Martin Grohe, Michal Koucky, Rüdiger Reischik, and Dieter van Melkebeek. Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121). In Dagstuhl Reports, Volume 1, Issue 3, pp. 42-66, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/DagRep.1.3.42

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 11121 ``Computational Complexity of Discrete Problems''. The first section gives an overview of the topics covered and the organization of the meeting. Section~2 lists the talks given in chronological order. The last section contains the abstracts of the talks.
Keywords
  • Discrete problems
  • computational complexity
  • Turing machines
  • Boolean circuits
  • quantum computing
  • communication and query complexity
  • extractors
  • pseudorandomness
  • derandomization
  • approximation
  • coding cryptography
  • algorithmic learning

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail