License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.07411.2
URN: urn:nbn:de:0030-drops-13061
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1306/
Go to the corresponding Portal

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

07411 Executive Summary -- Algebraic Methods in Computational Complexity

pdf-format:
07411_summary.1306.pdf (0.08 MB)

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.

BibTeX - Entry

@InProceedings{agrawal_et_al:DagSemProc.07411.2,
  author =	{Agrawal, Manindra and Buhrman, Harry and Fortnow, Lance and Thierauf, Thomas},
  title =	{{07411 Executive Summary – Algebraic Methods in Computational Complexity}},
  booktitle =	{Algebraic Methods in Computational Complexity},
  pages =	{1--3},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{7411},
  editor =	{Manindra Agrawal and Harry Buhrman and Lance Fortnow and Thomas Thierauf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2008/1306},
  URN =		{urn:nbn:de:0030-drops-13061},
  doi =		{10.4230/DagSemProc.07411.2},
  annote =	{Keywords: Computational complexity, algebra, quantum computing, (de-) randomization}
}

Keywords: Computational complexity, algebra, quantum computing, (de-) randomization
Collection: 07411 - Algebraic Methods in Computational Complexity
Issue Date: 2008
Date of publication: 16.01.2008

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI