<--- Back to Details
First PageDocument Content
Complexity classes / Probabilistic complexity theory / Probabilistically checkable proof / PCP theorem / Mathematical optimization / NP / IP / P / Low / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2008-07-28 11:22:52
Complexity classes
Probabilistic complexity theory
Probabilistically checkable proof
PCP theorem
Mathematical optimization
NP
IP
P
Low
Theoretical computer science
Computational complexity theory
Applied mathematics

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Download Document from Source Website

File Size: 918,97 KB

Share Document on Facebook

Similar Documents

Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem∗ Irit Dinur† Omer Reingold

DocID: 1mGw3 - View Document

Computational complexity theory / Theory of computation / Complexity classes / NP-complete problems / Mathematical optimization / NP-hard problems / MAX-3SAT / NP / Approximation algorithm / Probabilistically checkable proof / PCP theorem / APX

Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004

DocID: 1mroB - View Document

Probabilistic complexity theory / Theoretical computer science / Morphisms / Computational complexity theory / PCP theorem / Mathematical optimization / Probabilistically checkable proof / Combinatorica / IP / Algorithm / Russell Impagliazzo / Graph isomorphism

2015 Knuth Prize Citation for L´ aszl´ o Babai The 2015 Donald E. Knuth Prize is awarded to L´aszl´o Babai of the University of Chicago for his fundamental contributions to theoretical computer science, including alg

DocID: 1kcj5 - View Document

NP-complete problems / Vertex cover / Independent set / NP-complete / NP / PCP theorem / Maximal independent set / Power set / P versus NP problem / Theoretical computer science / Mathematics / Computational complexity theory

Annals of Mathematics, [removed]), 439–485 On the hardness of approximating minimum vertex cover By Irit Dinur and Samuel Safra*

DocID: RF9X - View Document

Probabilistic complexity theory / Complexity classes / Mathematical optimization / Probabilistically checkable proof / PCP theorem / NP / NEXPTIME / Hardness of approximation / P versus NP problem / Theoretical computer science / Computational complexity theory / Applied mathematics

The Tale of the PCP Theorem How the search for the limits of computing led to the discovery of the unexpected power of proofs Dana Moshkovitz, MIT

DocID: vxQs - View Document