Oberwolfach Reports
Full-Text PDF (508 KB) | Metadata |
Table of Contents | OWR summary
Published online: 2019-12-16
Complexity Theory
Peter Bürgisser[1], Irit Dinur[2], Oded Goldreich[3] and Salil Vadhan[4] (1) Technische Universität Berlin, Germany(2) Weizmann Institute of Science, Rehovot, Israel
(3) Weizmann Institute of Science, Rehovot, Israel
(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 quantum computation. 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, Dinur Irit, Goldreich Oded, Vadhan Salil: Complexity Theory. Oberwolfach Rep. 15 (2018), 3025-3080. doi: 10.4171/OWR/2018/51