Zur Kurzanzeige

Complexity Theory

dc.date.accessioned2019-10-24T14:35:20Z
dc.date.available2019-10-24T14:35:20Z
dc.date.issued2012
dc.identifier.urihttp://publications.mfo.de/handle/mfo/3325
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, and pseudorandomness. Many of the developments are related to diverse mathematical fields such as algebraic geometry, combinatorial number theory, probability theory, representation theory, and the theory of error-correcting codes.
dc.titleComplexity Theory
dc.rights.licenseDieses Dokument darf im Rahmen von § 53 UrhG zum eigenen Gebrauch kostenfrei heruntergeladen, gelesen, gespeichert und ausgedruckt, aber nicht im Internet bereitgestellt oder an Außenstehende weitergegeben werden.de
dc.rights.licenseThis document may be downloaded, read, stored and printed for your own use within the limits of § 53 UrhG but it may not be distributed via the internet or passed on to external parties.en
dc.identifier.doi10.14760/OWR-2012-54
local.series.idOWR-2012-54
local.subject.msc68
local.subject.msc94
local.sortindex765
local.date-range11 Nov - 17 Nov 2012
local.workshopcode1246
local.workshoptitleComplexity Theory
local.organizersPeter Bürgisser, Paderborn; Oded Goldreich, Rehovot; Madhu Sudan, Cambridge MA; Salil Vadhan, Cambridge MA
local.report-nameWorkshop Report 2012,54
local.opc-photo-id1246
local.publishers-doi10.4171/OWR/2012/54
local.ems-referenceBürgisser Peter, Goldreich Oded, Sudan Madhu, Vadhan Salil: Complexity Theory. Oberwolfach Rep. 9 (2012), 3267-3304. doi: 10.4171/OWR/2012/54


Dateien zu dieser Ressource

Thumbnail
Report

Das Dokument erscheint in:

Zur Kurzanzeige