@inproceedings{BGGS-Oberwolfach-Report-No-522009-On-Complexity-Theory,
Title = {Oberwolfach Report No. 52/2009 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.},
Url = {http://www3.math.tu-berlin.de/algebra/work/Report-52_2009.pdf},
Url2 = {http://www.ems-ph.org/journals/show_issue.php?issn=1660-8933&vol=6&iss=4},
Reviewed = {True}
}