Show simple item record

Complexity Theory

dc.date.accessioned2019-10-24T13:59:26Z
dc.date.available2019-10-24T13:59:26Z
dc.date.issued2009
dc.identifier.urihttp://publications.mfo.de/handle/mfo/3153
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 arithmetic complexity, Boolean complexity, communication complexity, cryptography, probabilistic proof systems, pseudorandomness, and quantum computation. Many of the developements are related to diverse mathematical fields such as algebraic geometry, combinatorial number theory, probability theory, quantum mechanics, representation theory, and the theory of error-correcting codes.
dc.titleComplexity Theory
dc.identifier.doi10.14760/OWR-2009-52
local.series.idOWR-2009-52
local.subject.msc94
local.subject.msc68
local.sortindex593
local.date-range15 Nov - 21 Nov 2009
local.workshopcode0947
local.workshoptitleComplexity Theory
local.organizersPeter Bürgisser, Paderborn; Joachim von zur Gathen, Bonn; Oded Goldreich, Rehovot; Madhu Sudan, MIT Cambridge
local.report-nameWorkshop Report 2009,52
local.opc-photo-id0947
local.publishers-doi10.4171/OWR/2009/52
local.ems-referenceBürgisser Peter, Goldreich Oded, von zur Gathen Joachim: Complexity Theory. Oberwolfach Rep. 6 (2009), 2787-2850. doi: 10.4171/OWR/2009/52


Files in this item

Thumbnail
Report

This item appears in the following Collection(s)

Show simple item record