Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121)

Gál, Anna; Koucký, Michal; Regev, Oded; Tantau, Till

doi:10.4230/DagRep.7.3.45

Document

Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121)

Authors Anna Gál, Michal Koucký, Oded Regev, Till Tantau and all authors of the abstracts in this report

Part of: Issue: Dagstuhl Reports, Volume 7, Issue 3
Part of: Volume: Dagstuhl Reports, Volume 7
Part of: Journal: Dagstuhl Reports (DagRep)
License: Creative Commons Attribution 3.0 Unported license
Publication Date: 2017-10-17

PDF

File

PDF

DagRep.7.3.45.pdf

Filesize: 3.06 MB
25 pages

Document Identifiers

DOI: 10.4230/DagRep.7.3.45
URN: urn:nbn:de:0030-drops-73611

Subject Classification

Keywords

Computational Complexity

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

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.

Cite As Get BibTex

Anna Gál, Michal Koucký, Oded Regev, and Till Tantau. Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121). In Dagstuhl Reports, Volume 7, Issue 3, pp. 45-69, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017) https://doi.org/10.4230/DagRep.7.3.45

Author Details

Anna Gál

Michal Koucký

Oded Regev

Till Tantau

and all authors of the abstracts in this report

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail