Algebraic Methods in Computational Complexity
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!
Additional Information
© 2009 Dagstuhl Publishing.Attached Files
Published - 09421.SWM.ExtendedAbstract.2410.pdf
Files
Name | Size | Download all |
---|---|---|
md5:3564e60b6af558bc6631859c341b860b
|
149.3 kB | Preview Download |
Additional details
- Eprint ID
- 100094
- Resolver ID
- CaltechAUTHORS:20191127-093701543
- Created
-
2019-11-27Created from EPrint's datestamp field
- Updated
-
2019-11-27Created from EPrint's last_modified field