Back to Results
First PageMeta Content
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
Add to Reading List

Document Date: 2012-04-12 18:03:28


Open Document

File Size: 503,76 KB

Share Result on Facebook

City

Reading / /

Company

Hp / /

Country

Sudan / /

Currency

USD / /

Facility

Clay Institute / store Si / /

IndustryTerm

worth algorithm / computing / pre-computing / approximation algorithms / /

Organization

MIT / Clay Institute / /

Person

Dana Moshkovitz / Michel Goemans / Muli Safra / David Williamson / Min-Cut / /

Position

author / researcher / salesman / /

Technology

approximation algorithms / GoemansWilliamson algorithm / 6 / 000 / 000 worth algorithm / flow-based algorithm / PCP technology / /

SocialTag