Back to Results
First PageMeta Content
NP-complete problems / Vertex cover / Independent set / NP-complete / NP / PCP theorem / Maximal independent set / Power set / P versus NP problem / Theoretical computer science / Mathematics / Computational complexity theory


Annals of Mathematics, [removed]), 439–485 On the hardness of approximating minimum vertex cover By Irit Dinur and Samuel Safra*
Add to Reading List

Document Date: 2006-04-11 06:21:40

Open Document

File Size: 999,08 KB

Share Result on Facebook
UPDATE