| dc.date.accessioned | 2022-02-11T10:59:56Z | |
| dc.date.available | 2022-02-11T10:59:56Z | |
| dc.date.issued | 2021 | |
| dc.identifier.uri | http://publications.mfo.de/handle/mfo/3918 | |
| 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
interactive proof systems, quantum information and computation, algorithmic coding theory,
arithmetic complexity, expansion of hypergraphs and simplicial complexes, Markov chain Monte Carlo,
and pseudorandomness.
Many of the developments are related to diverse mathematical fields
such as algebraic geometry, extremal combinatorics, combinatorial number theory,
probability theory, representation theory,
and operator algebras. | |
| dc.title | Complexity Theory (hybrid meeting) | |
| 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-2021-54 | |
| local.series.id | OWR-2021-54 | |
| local.subject.msc | 68 | |
| local.date-range | 14 Nov - 20 Nov 2021 | |
| local.workshopcode | 2146 | |
| local.workshoptitle | Complexity Theory (hybrid meeting) | |
| local.organizers | Peter Bürgisser, Berlin; Irit Dinur, Rehovot; Salil Vadhan, Cambridge MA | |
| local.report-name | Workshop Report 2021,54 | |
| local.opc-photo-id | 2146 | |
| local.publishers-doi | 10.4171/OWR/2021/54 | |
