Work

Complexity Theory

Year: 2024

Type: article

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 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.

Source: Oberwolfach Reports

DOI: 10.4171/owr/2024/27

Authors: Peter Bürgisser, Irit Dinur, Salil Vadhan

Institutions: Technische Universität Berlin, Weizmann Institute of Science, Harvard University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

OpenAlex ID: W4404692628

FWCI:

Cites:

Cited by:

Related to: 10