scientific article; zbMATH DE number 1789920

zbMath1001.68049MaRDI QIDQ4549231

Sanjeev Arora

Publication date: 6 October 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation algorithmsprobabilistically checkable proofscomplexity theoryNPPCP theorems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Product-state approximations to quantum states

This page was built for publication: