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

First Page		Document Content
Date: 2006-04-11 06:21:40 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 Source URL: www.wisdom.weizmann.ac.il Download Document from Source Website File Size: 999,08 KB Share Document on Facebook

	Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem∗ Irit Dinur† Omer Reingold DocID: 1mGw3 - View Document
	Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004 DocID: 1mroB - View Document
	2015 Knuth Prize Citation for L´ aszl´ o Babai The 2015 Donald E. Knuth Prize is awarded to L´aszl´o Babai of the University of Chicago for his fundamental contributions to theoretical computer science, including alg DocID: 1kcj5 - View Document
	Annals of Mathematics, [removed]), 439–485 On the hardness of approximating minimum vertex cover By Irit Dinur and Samuel Safra* DocID: RF9X - View Document
	The Tale of the PCP Theorem How the search for the limits of computing led to the discovery of the unexpected power of proofs Dana Moshkovitz, MIT DocID: vxQs - View Document