License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.9.3.64
URN: urn:nbn:de:0030-drops-112920
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/11292/
Gál, Anna ;
Santhanam, Rahul ;
Tantau, Till
Weitere Beteiligte (Hrsg. etc.): Anna Gál and Rahul Santhanam and Till Tantau
Computational Complexity of Discrete Problems (Dagstuhl Seminar 19121)
Abstract
The following report archives the presentations and activities of the March 2019 Dagstuhl Seminar 19121 "Computational Complexity of Discrete Problems". Section 1 summarizes the topics and some specific results offered in selected talks during the course of the week. Section 2 provides a table of contents, listing each of the talks given in alphabetical order. Section 3 contains the abstracts, indicating both the main reference and other relevant sources (where applicable) to allow the reader to investigate the topics further.
BibTeX - Entry
@Article{gl_et_al:DR:2019:11292,
author = {Anna G{\'a}l and Rahul Santhanam and Till Tantau},
title = {{Computational Complexity of Discrete Problems (Dagstuhl Seminar 19121)}},
pages = {64--82},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2019},
volume = {9},
number = {3},
editor = {Anna G{\'a}l and Rahul Santhanam and Till Tantau},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11292},
URN = {urn:nbn:de:0030-drops-112920},
doi = {10.4230/DagRep.9.3.64},
annote = {Keywords: circuit complexity, communication complexity, computational complexity, parametrisation, randomness}
}
|
Keywords: |
|
circuit complexity, communication complexity, computational complexity, parametrisation, randomness |
|
Collection: |
|
Dagstuhl Reports, Volume 9, Issue 3 |
|
Issue Date: |
|
2019 |
|
Date of publication: |
|
12.09.2019 |
