Mathematics and Computation

DOI10.1515/9780691192543zbMath1455.68004OpenAlexW4232685194MaRDI QIDQ4554784

Avi Wigderson

Publication date: 9 November 2018

Full work available at URL: https://doi.org/10.1515/9780691192543

zbMATH Keywords

computational complexitycomputational learning theorycryptographyonline algorithmsNP-completenessquantum computingdistributed computingtheory of computationproof systemscommunication complexitypolynomial hierarchypseudo-randomnesscomplexity theoryrandomnessarithmetic complexityproof complexitycomplexity classesP vs NP problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) General topics in the theory of computing (68Q01)

Related Items (12)

Unlabeled sample compression schemes and corner peelings for ample and maximum classes ⋮ Graph theory -- a survey on the occasion of the Abel Prize for László Lovász ⋮ Multi-experiment Parameter Identifiability of ODEs and Model Theory ⋮ Bounds on Kronecker coefficients via contingency tables ⋮ Interactions of computational complexity theory and mathematics ⋮ The Argument Against Quantum Computers ⋮ Unnamed Item ⋮ Symmetry in Fourier analysis: Heisenberg group to Stein-Weiss integrals ⋮ Moment subset sums over finite fields ⋮ Sex: the power of randomization ⋮ Mixing time of fractional random walk on finite fields ⋮ Bilevel optimization, deep learning and fractional Laplacian regularization with applications in tomography

This page was built for publication: Mathematics and Computation