A subscription is required to access this article.
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 ﬁelds such as algebraic geometry, combinatorial number theory, probability theory, quantum mechanics, representation theory, and the theory of error-correcting codes.
Cite this article
Joachim von zur Gathen, Oded Goldreich, Peter Bürgisser, Complexity Theory. Oberwolfach Rep. 6 (2009), no. 4, pp. 2787–2850DOI 10.4171/OWR/2009/52