Show simple item record

Complexity Theory

dc.date.accessioned2019-10-24T15:49:53Z
dc.date.available2019-10-24T15:49:53Z
dc.date.issued2018
dc.identifier.urihttp://publications.mfo.de/handle/mfo/3673
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 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-2018-51
local.series.idOWR-2018-51
local.subject.msc68
local.sortindex1113
local.date-range11 Nov - 17 Nov 2018
local.workshopcode1846
local.workshoptitleComplexity Theory
local.organizersPeter Bürgisser, Berlin; Irit Dinur, Rehovot; Oded Goldreich, Rehovot; Salil Vadhan, Cambridge MA
local.report-nameWorkshop Report 2018,51
local.opc-photo-id1846
local.publishers-doi10.4171/OWR/2018/51


Files in this item

Thumbnail
Report

This item appears in the following Collection(s)

Show simple item record