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

Document Date: 2008-02-01 14:51:28

Open Document

File Size: 460,93 KB

Share Result on Facebook
UPDATE