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 fine-grained complexity, algorithmic fairness, pseudorandomness, cryptography, arithmetic complexity, Markov Chain Monte Carlo, structure vs. randomness in combinatorics and complexity, meta-complexity, and the complexity of approximation problems. Many of the developments are related to diverse mathematical fields such as algebra, geometry, combinatorics, analysis, and coding theory.
(:unkn) unknown (Mon,) studied this question.