2026-07-23T18:07:26Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3193 2024-03-06T10:25:41Z ddc:004 open_access

Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121) Grohe, Martin Koucky, Michal Reischik, Rüdiger van Melkebeek, Dieter Discrete problems computational complexity Turing machines Boolean circuits quantum computing communication and query complexity extractors pseudorandomness derandomization approximation coding cryptography algorithmic learning This report documents the program and the outcomes of Dagstuhl Seminar 11121 ``Computational Complexity of Discrete Problems''. The first section gives an overview of the topics covered and the organization of the meeting. Section~2 lists the talks given in chronological order. The last section contains the abstracts of the talks. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Martin Grohe and Michal Koucky and Rüdiger Reischik and Dieter van Melkebeek 2011 Is Part Of Dagstuhl Reports, Volume 1, Issue 3 (2011) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.1.3.42 urn:nbn:de:0030-drops-31935 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.3.42 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode