2146
Complexity Theory (hybrid meeting)
Workshop
2146Period
14 Nov - 20 Nov 2021Abstract
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.