2008/01/01 by Manindra Agrawal, Agrawal, Manindra, Harry Buhrman +5
Computer Science · #Complexity and Algorithms in Graphs #Polynomial and algebraic computation
paper · doi:10.4230/dagsemproc.07411.1
From 07.10. to 12.10., the Dagstuhl Seminar 07411 ``Algebraic Methods in Computational Complexity'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. 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.