2026-07-23T20:16:43Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4592 2024-03-06T10:26:11Z ddc:004 open_access

Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121) Gal, Anna Koucky, Michal Regev, Oded Reischuk, Rüdiger discrete problems computational complexity Turing machines Boolean circuits arithmetic circuits quantum computing communication complexity pseudorandomness derandomization approximation data streams This report documents the program and the outcomes of Dagstuhl Seminar 14121 "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 Anna Gal and Michal Koucky and Oded Regev and Rüdiger Reischuk 2014 Is Part Of Dagstuhl Reports, Volume 4, Issue 3 (2014) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.4.3.62 urn:nbn:de:0030-drops-45921 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.3.62 eng https://creativecommons.org/licenses/by/3.0/legalcode