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



PDF
Thumbnail PDF

File

DagRep.7.3.45.pdf
  • Filesize: 3.06 MB
  • 25 pages

Document Identifiers

Author Details

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

Cite AsGet 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

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.
Keywords
  • Computational Complexity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail