Document Open Access Logo

Computational Complexity of Discrete Problems (Dagstuhl Seminar 19121)

Authors Anna Gál, Rahul Santhanam, Till Tantau and all authors of the abstracts in this report

PDF

File

Thumbnail PDF
PDF
DagRep.9.3.64.pdf
  • Filesize: 4.18 MB
  • 19 pages

Document Identifiers

Subject Classification

Keywords
  • circuit complexity
  • communication complexity
  • computational complexity
  • parametrisation
  • randomness

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

The following report archives the presentations and activities of the March 2019 Dagstuhl Seminar 19121 "Computational Complexity of Discrete Problems".  Section 1 summarizes the topics and some specific results offered in selected talks during the course of the week.  Section 2 provides a table of contents, listing each of the talks given in alphabetical order.  Section 3 contains the abstracts, indicating both the main reference and other relevant sources (where applicable) to allow the reader to investigate the topics further.

Cite As Get BibTex

Anna Gál, Rahul Santhanam, and Till Tantau. Computational Complexity of Discrete Problems (Dagstuhl Seminar 19121). In Dagstuhl Reports, Volume 9, Issue 3, pp. 64-82, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019) https://doi.org/10.4230/DagRep.9.3.64

Author Details

Anna Gál
Rahul Santhanam
Till Tantau
and all authors of the abstracts in this report
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact