DagRep.9.3.64.pdf
- Filesize: 4.18 MB
- 19 pages
Document
Computational Complexity of Discrete Problems (Dagstuhl Seminar 19121)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 9, Issue 3
Volume: Dagstuhl Reports, Volume 9
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2019-09-12
Cite AsGet BibTex
Anna Gál, Rahul Santhanam, and Till Tantau. Computational Complexity of Discrete Problems (Dagstuhl Seminar 19121). In Dagstuhl Reports, Volume 9, Issue 3, pp. 64-82, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/DagRep.9.3.64
https://doi.org/10.4230/DagRep.9.3.64
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.
Keywords
- circuit complexity
- communication complexity
- computational complexity
- parametrisation
- randomness
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads