Document Open Access Logo

09421 Executive Summary – Algebraic Methods in Computational Complexity

Authors Manindra Agrawal, Lance Fortnow, Thomas Thierauf, Christopher Umans

PDF

File

Thumbnail PDF
PDF
DagSemProc.09421.2.pdf
  • Filesize: 145 kB
  • 4 pages

Document Identifiers

Subject Classification

Keywords
  • Computational Complexity
  • Algebra

Metrics

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

Abstract

The seminar brought together more than 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, most of them about 40 minutes leaving ample room for
discussions. We also had a much appreciated open problem
session.

The talks ranged over a
broad assortment of subjects with the underlying theme of using
algebraic techniques. It was very fruitful and has hopefully
initiated new directions in research. Several participants
specifically mentioned that they appreciated the particular
focus on a common class of techniques (rather than end
results) as a unifying theme of the workshop. We look forward
to our next meeting!

Cite As Get BibTex

Manindra Agrawal, Lance Fortnow, Thomas Thierauf, and Christopher Umans. 09421 Executive Summary – Algebraic Methods in Computational Complexity. In Algebraic Methods in Computational Complexity. Dagstuhl Seminar Proceedings, Volume 9421, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010) https://doi.org/10.4230/DagSemProc.09421.2

Author Details

Manindra Agrawal
Lance Fortnow
Thomas Thierauf
Christopher Umans
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
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact