License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-13061
URL: http://drops.dagstuhl.de/opus/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:
Document 1.pdf (86 KB)


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:DSP:2008:1306,
  author =	{Manindra Agrawal and Harry Buhrman and Lance Fortnow and Thomas Thierauf},
  title =	{07411 Executive Summary -- Algebraic Methods in Computational Complexity},
  booktitle =	{Algebraic Methods in Computational Complexity},
  year =	{2008},
  editor =	{Manindra Agrawal and Harry Buhrman and Lance Fortnow and Thomas Thierauf},
  number =	{07411},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2008/1306},
  annote =	{Keywords: Computational complexity, algebra, quantum computing, (de-) randomization}
}

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


DROPS-Home | Fulltext Search | Imprint Published by LZI