> Details

Gal, Anna [Author]; Koucky, Michal [Author]; Regev, Oded [Author]; Reischuk, Rüdiger [Author] ; Anna Gal and Michal Koucky and Oded Regev and Rüdiger Reischuk [Contributor]

Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121)

Reference
management

Bookmarks

Remove from
bookmarks

Share this on Whatsapp

Close

Bookmarks



You can manage bookmarks using lists, please log in to your user account for this.
  • Media type: Text; E-Article
  • Title: Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121)
  • Contributor: Gal, Anna [Author]; Koucky, Michal [Author]; Regev, Oded [Author]; Reischuk, Rüdiger [Author]
  • imprint: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2014
  • Language: English
  • DOI: https://doi.org/10.4230/DagRep.4.3.62
  • Keywords: computational complexity ; data streams ; approximation ; communication complexity ; discrete problems ; pseudorandomness ; arithmetic circuits ; Turing machines ; Boolean circuits ; derandomization ; quantum computing
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: This report documents the program and the outcomes of Dagstuhl Seminar 14121 "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.
  • Access State: Open Access