DagRep.11.2.1.pdf
- Filesize: 1.29 MB
- 16 pages
Document
Computational Complexity of Discrete Problems (Dagstuhl Seminar 21121)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 11, Issue 2
Volume: Dagstuhl Reports, Volume 11
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2021-09-07
Cite As Get BibTex
Anna Gál, Meena Mahajan, Rahul Santhanam, and Till Tantau. Computational Complexity of Discrete Problems (Dagstuhl Seminar 21121). In Dagstuhl Reports, Volume 11, Issue 2, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/DagRep.11.2.1
Abstract
This report documents the program and activities of Dagstuhl Seminar 21121 "Computational Complexity of Discrete Problems," which was held online in March 2021. Starting with a description of the organization of the online meeting and the topics covered, we then list the different talks given during the seminar in alphabetical order of speakers, followed by the abstracts of the talks, including the main references and relevant sources where applicable. Despite the fact that only a compressed daily time slot was available for the seminar with participants from time zones spanning the whole globe and despite the fact that informal discussions were harder to hold than in a typical on-site seminar, the rate of participation throughout the seminar was very high and many lively scientific debates were held.
Subject Classification
ACM Subject Classification
- Theory of computation → Computational complexity and cryptography
- Theory of computation → Design and analysis of algorithms
Keywords
- circuit complexity
- communication complexity
- computational complexity
- lower bounds
- randomness
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads