07411 Executive Summary – Algebraic Methods in Computational Complexity

Agrawal, Manindra; Buhrman, Harry; Fortnow, Lance; Thierauf, Thomas

doi:10.4230/DagSemProc.07411.2

Document

07411 Executive Summary – Algebraic Methods in Computational Complexity

Authors Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf

Part of: Volume: Dagstuhl Seminar Proceedings, Volume 7411
Part of: Series: Dagstuhl Seminar Proceedings (DagSemProc)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2008-01-16

PDF

File

PDF

DagSemProc.07411.2.pdf

Filesize: 86 kB
3 pages

Document Identifiers

DOI: 10.4230/DagSemProc.07411.2
URN: urn:nbn:de:0030-drops-13061

Subject Classification

Keywords

Computational complexity
algebra
quantum computing
(de-) randomization

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

The seminar brought together almost 50 researchers covering a wide
spectrum of complexity theory. The focus on algebraic methods showed
once again the great importance of algebraic techniques for
theoretical computer science. We had almost 30 talks of length
between 15 and 45 minutes. This left enough room for discussions. We
had an open problem session that was very much appreciated.

Cite As Get BibTex

Manindra Agrawal, Harry Buhrman, Lance Fortnow, and Thomas Thierauf. 07411 Executive Summary – Algebraic Methods in Computational Complexity. In Algebraic Methods in Computational Complexity. Dagstuhl Seminar Proceedings, Volume 7411, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008) https://doi.org/10.4230/DagSemProc.07411.2

Author Details

Manindra Agrawal

Harry Buhrman

Lance Fortnow

Thomas Thierauf

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