2026-07-22T00:08:32Z https://drops.dagstuhl.de/oai

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

Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121) Gál, Anna Koucký, Michal Regev, Oded Tantau, Till Computational Complexity This report documents the program and the outcomes of Dagstuhl Seminar 17121 "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 alphabetical order. The last section contains the abstracts of the talks. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Anna Gál and Michal Koucký and Oded Regev and Till Tantau 2017 Is Part Of Dagstuhl Reports, Volume 7, Issue 3 (2017) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.7.3.45 urn:nbn:de:0030-drops-73611 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.7.3.45 eng https://creativecommons.org/licenses/by/3.0/legalcode