The EMS Publishing House is now EMS Press and has its new home at ems.press.

Please find all EMS Press journals and articles on the new platform.

Oberwolfach Reports


Full-Text PDF (455 KB) | Introduction as PDF | Metadata | Table of Contents | OWR summary
Online access to the full text of Oberwolfach Reports is restricted to the subscribers of the journal, who are encouraged to communicate their IP-address(es) to their agent or directly to the publisher at
subscriptions@ems-ph.org
Volume 12, Issue 4, 2015, pp. 3049–3099
DOI: 10.4171/OWR/2015/54

Published online: 2016-06-27

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, pseudorandomness and randomness extraction. 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. 12 (2015), 3049-3099. doi: 10.4171/OWR/2015/54