Complexity theory. Abstracts from the workshop held November 15th -- November 21st, 2009 (Q985400)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5764259
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity theory. Abstracts from the workshop held November 15th -- November 21st, 2009 |
scientific article; zbMATH DE number 5764259 |
Statements
Complexity theory. Abstracts from the workshop held November 15th -- November 21st, 2009 (English)
0 references
5 August 2010
0 references
Summary: 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 fields such as algebraic geometry, combinatorial number theory, probability theory, quantum mechanics, representation theory, and the theory of error-correcting codes.
0 references
0.9814332127571106
0 references
0.9802953600883484
0 references
0.9771397113800048
0 references
0.9571227431297302
0 references
0.8219492435455322
0 references
