TU Berlin

Fachgebiet Algorithmische AlgebraIn Proceedings

Inhalt des Dokuments

zur Navigation

In Proceedings

Oberwolfach Report No. 52/2009 on "Complexity Theory"
Zitatschlüssel BGGS-Oberwolfach-Report-No-522009-On-Complexity-Theory
Autor Peter Bürgisser and Joachim von zur Gathen and Oded Goldreich and Madhu Sudan
Seiten 2787-2850
Jahr 2009
Jahrgang 6
Nummer 4
Verlag European Mathematical Society
Serie Oberwolfach Reports
Zusammenfassung 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 zur Publikation Link zur Originalpublikation Download Bibtex Eintrag



Schnellnavigation zur Seite über Nummerneingabe