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.09421.1
URN: urn:nbn:de:0030-drops-24181
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2010/2418/
|
Go to the corresponding Portal |
Agrawal, Manindra ;
Fortnow, Lance ;
Thierauf, Thomas ;
Umans, Christopher
09421 Abstracts Collection -- Algebraic Methods in Computational Complexity
Abstract
From 11.10. to 16.10.2009, the Dagstuhl Seminar 09421 ``Algebraic Methods in Computational Complexity '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available.
BibTeX - Entry
@InProceedings{agrawal_et_al:DagSemProc.09421.1,
author = {Agrawal, Manindra and Fortnow, Lance and Thierauf, Thomas and Umans, Christopher},
title = {{09421 Abstracts Collection – Algebraic Methods in Computational Complexity}},
booktitle = {Algebraic Methods in Computational Complexity},
pages = {1--22},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2010},
volume = {9421},
editor = {Manindra Agrawal and Lance Fortnow and Thomas Thierauf and Christopher Umans},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2010/2418},
URN = {urn:nbn:de:0030-drops-24181},
doi = {10.4230/DagSemProc.09421.1},
annote = {Keywords: Computational Complexity, Algebra}
}
|
Keywords: |
|
Computational Complexity, Algebra |
|
Collection: |
|
09421 - Algebraic Methods in Computational Complexity |
|
Issue Date: |
|
2010 |
|
Date of publication: |
|
20.01.2010 |
