First Page | Document Content | |
---|---|---|
Date: 2006-04-11 06:21:40NP-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 ListSource URL: www.wisdom.weizmann.ac.ilDownload Document from Source WebsiteFile Size: 999,08 KBShare Document on Facebook |