Oberwolfach Reports


Full-Text PDF (363 KB) | Introduction as PDF | Metadata | Table of Contents | OWR summary
Volume 9, Issue 4, 2012, pp. 3267–3304
DOI: 10.4171/OWR/2012/54

Published online: 2013-08-07

Complexity Theory

Peter Bürgisser[1], Oded Goldreich[2], Madhu Sudan[3] and Salil Vadhan[4]

(1) Technische Universität Berlin, Germany
(2) Weizmann Institute of Science, Rehovot, Israel
(3) The Stata Center, Cambridge, United States
(4) Harvard University, Cambridge, USA

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, and pseudorandomness. Many of the developments are related to diverse mathematical fields such as algebraic geometry, combinatorial number theory, probability theory, representation theory, and the theory of error-correcting codes.

No keywords available for this article.

Bürgisser Peter, Goldreich Oded, Sudan Madhu, Vadhan Salil: Complexity Theory. Oberwolfach Rep. 9 (2012), 3267-3304. doi: 10.4171/OWR/2012/54