Complexity Theory

Peter Bürgisser; Irit Dinur; Oded Goldreich; Salil Vadhan

doi:10.4171/OWR/2018/51

Complexity Theory

Peter Bürgisser, Irit Dinur, Oded Goldreich, Salil Vadhan

Department of Computer Science and Applied Mathematics

Weizmann Institute of Science

Research output: Contribution to journal › Article

Abstract

Computational 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.

Original language	English
Pages (from-to)	3025-3080
Number of pages	56
Journal	Oberwolfach reports
Volume	15
Issue number	4
DOIs	https://doi.org/10.4171/OWR/2018/51
State	Published - Nov 2018

Access to Document

10.4171/OWR/2018/51

Cite this

@article{2a0701898b824ae39318a785a936db24,

title = "Complexity Theory",

abstract = "Computational 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.",

author = "Peter B{\"u}rgisser and Irit Dinur and Oded Goldreich and Salil Vadhan",

note = "The MFO and the workshop organizers would like to thank the National Science Foundation for supporting the participation of junior researchers in the workshop by the grant DMS-1641185, “US Junior Oberwolfach Fellows”. Moreover, the MFO and the workshop organizers would like to thank the Simons Foundation for supporting Joseph Landsberg and Luca Trevisan in the “Simons Visiting Professors” program at the MFO.",

year = "2018",

month = nov,

doi = "10.4171/OWR/2018/51",

language = "الإنجليزيّة",

volume = "15",

pages = "3025--3080",

journal = "Oberwolfach reports",

issn = "1660-8933",

number = "4",

}

TY - JOUR

T1 - Complexity Theory

AU - Bürgisser, Peter

AU - Dinur, Irit

AU - Goldreich, Oded

AU - Vadhan, Salil

N1 - The MFO and the workshop organizers would like to thank the National Science Foundation for supporting the participation of junior researchers in the workshop by the grant DMS-1641185, “US Junior Oberwolfach Fellows”. Moreover, the MFO and the workshop organizers would like to thank the Simons Foundation for supporting Joseph Landsberg and Luca Trevisan in the “Simons Visiting Professors” program at the MFO.

PY - 2018/11

Y1 - 2018/11

N2 - Computational 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.

AB - Computational 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.

U2 - 10.4171/OWR/2018/51

DO - 10.4171/OWR/2018/51

M3 - مقالة

SN - 1660-8933

VL - 15

SP - 3025

EP - 3080

JO - Oberwolfach reports

JF - Oberwolfach reports

IS - 4

ER -