| dc.date.accessioned | 2019-10-24T15:49:53Z | |
| dc.date.available | 2019-10-24T15:49:53Z | |
| dc.date.issued | 2018 | |
| dc.identifier.uri | http://publications.mfo.de/handle/mfo/3673 | |
| dc.description.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 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. | |
| dc.title | Complexity Theory | |
| dc.rights.license | Dieses Dokument darf im Rahmen von § 53 UrhG zum eigenen Gebrauch kostenfrei heruntergeladen, gelesen, gespeichert und ausgedruckt, aber nicht im Internet bereitgestellt oder an Außenstehende weitergegeben werden. | de |
| dc.rights.license | This document may be downloaded, read, stored and printed for your own use within the limits of § 53 UrhG but it may not be distributed via the internet or passed on to external parties. | en |
| dc.identifier.doi | 10.14760/OWR-2018-51 | |
| local.series.id | OWR-2018-51 | |
| local.subject.msc | 68 | |
| local.sortindex | 1113 | |
| local.date-range | 11 Nov - 17 Nov 2018 | |
| local.workshopcode | 1846 | |
| local.workshoptitle | Complexity Theory | |
| local.organizers | Peter Bürgisser, Berlin; Irit Dinur, Rehovot; Oded Goldreich, Rehovot; Salil Vadhan, Cambridge MA | |
| local.report-name | Workshop Report 2018,51 | |
| local.opc-photo-id | 1846 | |
| local.publishers-doi | 10.4171/OWR/2018/51 | |
