Zur Kurzanzeige

Complexity Theory

dc.date.accessioned2019-10-24T13:06:31Z
dc.date.available2019-10-24T13:06:31Z
dc.date.issued2005
dc.identifier.urihttp://publications.mfo.de/handle/mfo/2900
dc.description.abstractComputational Complexity Theory is the mathematical study of resources like time, space, or randomness that are required to solve computational problems. The current workshop was focused on recent developments, and the interplay between randomness and computation played a central role in many of them.
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-2005-26
local.series.idOWR-2005-26
local.subject.msc68
local.sortindex340
local.date-range05 Jun - 11 Jun 2005
local.workshopcode0523
local.workshoptitleComplexity Theory
local.organizersJoachim von zur Gathen, Paderborn; Oded Goldreich, Rehovot; Claus-Peter Schnorr, Frankfurt; Madhu Sudan, MIT
local.report-nameWorkshop Report 2005,26
local.opc-photo-id0523
local.publishers-doi10.4171/OWR/2005/26
local.ems-referenceGoldreich Oded, Schnorr Claus-Peter, Sudan Madhu, von zur Gathen Joachim: Complexity Theory. Oberwolfach Rep. 2 (2005), 1431-1504. doi: 10.4171/OWR/2005/26


Dateien zu dieser Ressource

Thumbnail
Report

Das Dokument erscheint in:

Zur Kurzanzeige