Back to Results
First PageMeta Content
Probabilistic complexity theory / Structural complexity theory / NP-complete problems / Approximation algorithms / 2-satisfiability / L-reduction / Reduction / PCP theorem / Probabilistically checkable proof / Theoretical computer science / Applied mathematics / Computational complexity theory


Approximation Algorithms (ADM III)
Add to Reading List

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

Open Document

File Size: 98,82 KB

Share Result on Facebook
UPDATE