Show simple item record

Complexity Theory

dc.date.accessioned2025-02-26T12:33:43Z
dc.date.available2025-02-26T12:33:43Z
dc.date.issued2024
dc.identifier.urihttp://publications.mfo.de/handle/mfo/4222
dc.description.abstractComputational 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.
dc.rights.urihttp://creativecommons.org/licenses/by-sa/4.0/
dc.titleComplexity Theory
dc.rights.licenseUnless otherwise noted, the content of this report is licensed under Creative Commons Attribution-ShareAlike 4.0 International.*
dc.identifier.doi10.14760/OWR-2024-27
local.series.idOWR-2024-27
local.subject.msc68
local.date-range02 Jun - 07 Jun 2024
local.workshopcode2423
local.workshoptitleComplexity Theory
local.organizersPeter Bürgisser, Berlin; Irit Dinur, Rehovot; Salil Vadhan, Cambridge MA
local.report-nameWorkshop Report 2024,27
local.opc-photo-id2423
local.publishers-doi10.4171/OWR/2024/27


Files in this item

Thumbnail
Report

This item appears in the following Collection(s)

Show simple item record

http://creativecommons.org/licenses/by-sa/4.0/
Except where otherwise noted, this item's license is described as http://creativecommons.org/licenses/by-sa/4.0/