On the average complexity of algorithms over the rationals


From 01.02.04 to 06.02.04, the Dagstuhl Seminar 04061 Real Computation and 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 rst section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.


0 Figures and Tables

    Download Full PDF Version (Non-Commercial Use)