Oberwolfach Reports


Full-Text PDF (566 KB) | Introduction as PDF | Metadata | Table of Contents | OWR summary
Volume 6, Issue 4, 2009, pp. 2787–2850
DOI: 10.4171/OWR/2009/52

Published online: 2010-09-01

Complexity Theory

Peter Bürgisser[1], Oded Goldreich[2] and Joachim von zur Gathen[3]

(1) Technische Universität Berlin, Germany
(2) Weizmann Institute of Science, Rehovot, Israel
(3) Universität Bonn, Germany

Computational Complexity Theory is the mathematical study of the intrinsic power and limitations of computational resources like time, space, or randomness. The current workshop focused on recent developments in various sub-areas including arithmetic complexity, Boolean complexity, communication complexity, cryptography, probabilistic proof systems, pseudorandomness, and quantum computation. Many of the developements are related to diverse mathematical fields such as algebraic geometry, combinatorial number theory, probability theory, quantum mechanics, representation theory, and the theory of error-correcting codes.

No keywords available for this article.

Bürgisser Peter, Goldreich Oded, von zur Gathen Joachim: Complexity Theory. Oberwolfach Rep. 6 (2009), 2787-2850. doi: 10.4171/OWR/2009/52