Probabilistic Checking of Proofs and Hardness of Approximation Problems

First Page		Document Content
Date: 2005-03-10 11:31:01 Probabilistic complexity theory Mathematical optimization Probabilistically checkable proof Sanjeev Arora PCP theorem Complexity classes MAX-3SAT Hardness of approximation NP Theoretical computer science Applied mathematics Computational complexity theory		Probabilistic Checking of Proofs and Hardness of Approximation Problems Add to Reading List Source URL: www.cs.princeton.edu Download Document from Source Website File Size: 949,44 KB Share Document on Facebook

	Genomes containing Duplicates are Hard to compare (Extended Abstract)? Cedric Chauve1 , Guillaume Fertin2 , Romeo Rizzi3 , and St´ephane Vialette4 ` Montr´eal LaCIM et D´epartement d’Informatique, Universit´e du Qu DocID: 1qIfg - View Document
	Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004 DocID: 1mroB - View Document
	RevCalcDisc_MGnewuch_et_al.dvi DocID: 1jjJM - View Document
	Seminar on Sublinear Time Algorithms Lecture 5 April 21, 2010 Lecturer: Robert Krauthgamer DocID: 1aKTH - View Document