Back to Results
First PageMeta Content
NP-complete problems / Probabilistic complexity theory / Mathematical optimization / Complexity classes / PCP theorem / Approximation algorithm / Clique problem / Probabilistically checkable proof / Time complexity / Theoretical computer science / Computational complexity theory / Applied mathematics


Chapter 9: The Hardness of Approximation (cp. Williamson & Shmoys, Chapter[removed]
Add to Reading List

Document Date: 2013-02-14 13:17:57

Open Document

File Size: 212,17 KB

Share Result on Facebook
UPDATE