2026-07-21T11:10:31Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1306 2024-03-06T11:07:44Z ddc:004 open_access

07411 Executive Summary – Algebraic Methods in Computational Complexity Agrawal, Manindra Buhrman, Harry Fortnow, Lance Thierauf, Thomas Computational complexity algebra quantum computing (de-) randomization The seminar brought together almost 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 of length between 15 and 45 minutes. This left enough room for discussions. We had an open problem session that was very much appreciated. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Manindra Agrawal and Harry Buhrman and Lance Fortnow and Thomas Thierauf 2008 Is Part Of Dagstuhl Seminar Proceedings, Volume 7411, Algebraic Methods in Computational Complexity (2008) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.07411.2 urn:nbn:de:0030-drops-13061 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07411.2 eng https://creativecommons.org/licenses/by/4.0/legalcode