Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121)

Gal, Anna; Koucky, Michal; Regev, Oded; Reischuk, Rüdiger

doi:10.4230/DagRep.4.3.62

Document

Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121)

Authors Anna Gal, Michal Koucky, Oded Regev, Rüdiger Reischuk and all authors of the abstracts in this report

Part of: Issue: Dagstuhl Reports, Volume 4, Issue 3
Part of: Volume: Dagstuhl Reports, Volume 4
Part of: Journal: Dagstuhl Reports (DagRep)
License: Creative Commons Attribution 3.0 Unported license
Publication Date: 2014-07-01

PDF

File

PDF

DagRep.4.3.62.pdf

Filesize: 0.89 MB
23 pages

Document Identifiers

DOI: 10.4230/DagRep.4.3.62
URN: urn:nbn:de:0030-drops-45921

Subject Classification

Keywords

discrete problems
computational complexity
Turing machines
Boolean circuits
arithmetic circuits
quantum computing
communication complexity
pseudorandomness
derandomization
approximation
data streams

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 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.

Cite As Get BibTex

Anna Gal, Michal Koucky, Oded Regev, and Rüdiger Reischuk. Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121). In Dagstuhl Reports, Volume 4, Issue 3, pp. 62-84, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014) https://doi.org/10.4230/DagRep.4.3.62

Author Details

Anna Gal

Michal Koucky

Oded Regev

Rüdiger Reischuk

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