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


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

Document Date: 2013-02-14 09:39:33


Open Document

File Size: 186,83 KB

Share Result on Facebook
UPDATE