DagSemProc.09421.1.pdf
- Filesize: 263 kB
- 22 pages
Document
09421 Abstracts Collection – Algebraic Methods in Computational Complexity
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 9421
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2010-01-20
Cite AsGet BibTex
Manindra Agrawal, Lance Fortnow, Thomas Thierauf, and Christopher Umans. 09421 Abstracts Collection – Algebraic Methods in Computational Complexity. In Algebraic Methods in Computational Complexity. Dagstuhl Seminar Proceedings, Volume 9421, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/DagSemProc.09421.1
https://doi.org/10.4230/DagSemProc.09421.1
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.
Keywords
- Computational Complexity
- Algebra
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads