TU Berlin

Fachgebiet Algorithmische AlgebraRefereed Contributions

Page Content

to Navigation

There is no English translation for this web page.

Refereed Contributions

Oberwolfach Report No. 52/2009 on "Complexity Theory"
Citation key BGGS-Oberwolfach-Report-No-522009-On-Complexity-Theory
Author Peter Bürgisser and Joachim von zur Gathen and Oded Goldreich and Madhu Sudan
Pages 2787-2850
Year 2009
Volume 6
Number 4
Publisher European Mathematical Society
Series Oberwolfach Reports
Abstract 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.
Link to publication Link to original publication Download Bibtex entry

Navigation

Quick Access

Schnellnavigation zur Seite über Nummerneingabe