2026-07-21T14:19:31Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:24900 2026-02-09T12:30:27Z ddc:004 open_access

Computational Complexity of Discrete Problems (Dagstuhl Seminar 25111) Kopparty, Swastik Mahajan, Meena Santhanam, Rahul Tantau, Till Mertz, Ian circuit complexity communication complexity computational complexity lower bounds randomness This report documents the program and activities of Dagstuhl Seminar 25111 "Computational Complexity of Discrete Problems," which was held during March 09-14, 2025. The seminar brought together researchers working in many diverse sub-areas of computational complexity, promoting a vibrant exchange of ideas. 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Swastik Kopparty and Meena Mahajan and Rahul Santhanam and Till Tantau and Ian Mertz 2025 Is Part Of Dagstuhl Reports, Volume 15, Issue 3 (2025) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.15.3.56 urn:nbn:de:0030-drops-249007 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.3.56 eng https://creativecommons.org/licenses/by/4.0/legalcode