2026-07-21T23:22:25Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:19226 2026-04-20T13:12:33Z ddc:004 open_access

Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111) Gál, Anna Mahajan, Meena Santhanam, Rahul Tantau, Till Paraashar, Manaswi circuit complexity communication complexity computational complexity lower bounds randomness 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Anna Gál and Meena Mahajan and Rahul Santhanam and Till Tantau and Manaswi Paraashar 2023 Is Part Of Dagstuhl Reports, Volume 13, Issue 3 (2023) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.13.3.17 urn:nbn:de:0030-drops-192261 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.3.17 eng https://creativecommons.org/licenses/by/4.0/legalcode