Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/DagRep.4.3.62
URN: urn:nbn:de:0030-drops-45921
URL: https://drops.dagstuhl.de/opus/volltexte/2014/4592/
Gal, Anna ; Koucky, Michal ; Regev, Oded ; Reischuk, Rüdiger
Weitere Beteiligte (Hrsg. etc.): Anna Gal and Michal Koucky and Oded Regev and Rüdiger Reischuk
Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121)
| pdf-format: |
|
Abstract
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.
BibTeX - Entry
@Article{gal_et_al:DR:2014:4592,
author = {Anna Gal and Michal Koucky and Oded Regev and R{\"u}diger Reischuk},
title = {{Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121)}},
pages = {62--84},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2014},
volume = {4},
number = {3},
editor = {Anna Gal and Michal Koucky and Oded Regev and R{\"u}diger Reischuk},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2014/4592},
URN = {urn:nbn:de:0030-drops-45921},
doi = {10.4230/DagRep.4.3.62},
annote = {Keywords: discrete problems, computational complexity, Turing machines, Boolean circuits, arithmetic circuits, quantum computing,}
}
| Keywords: | discrete problems, computational complexity, Turing machines, Boolean circuits, arithmetic circuits, quantum computing, | |
| Freie Schlagwörter (englisch): | communication complexity, pseudorandomness, derandomization, approximation, data streams | |
| Seminar: | Dagstuhl Reports, Volume 4, Issue 3 | |
| Issue date: | 2014 | |
| Date of publication: | 01.07.2014 |
