DagRep.13.3.17.pdf
- Filesize: 2.27 MB
- 15 pages
Document
Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 13, Issue 3
Volume: Dagstuhl Reports, Volume 13
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2023-10-16
Cite AsGet BibTex
Anna Gál, Meena Mahajan, Rahul Santhanam, Till Tantau, and Manaswi Paraashar. Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111). In Dagstuhl Reports, Volume 13, Issue 3, pp. 17-31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/DagRep.13.3.17
https://doi.org/10.4230/DagRep.13.3.17
Abstract
This report documents the program and activities of Dagstuhl Seminar 23111 "Computational Complexity of Discrete Problems", which was held in-person in March 2023 (the previous instance of the seminar series had been held online in March 2021). Following a description of the seminar’s objectives and its overall organization, this report lists the different major 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. The return to an in-person setting allowed an intense atmosphere of active research and interaction throughout the five day seminar.
Subject Classification
ACM Subject Classification
- Theory of computation → Probabilistic computation
- Theory of computation → Streaming models
- Theory of computation → Circuit complexity
- Theory of computation → Pseudorandomness and derandomization
Keywords
- circuit complexity
- communication complexity
- computational complexity
- lower bounds
- randomness
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads