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

	Hardness of approximation for vertex-connectivity network design problems Guy Kortsarz∗ Robert Krauthgamer† DocID: 1uwF6 - View Document
	Amplified Hardness of Approximation for VCG-Based Mechanisms Shaddin Dughmi Department of Computer Science Stanford University DocID: 1u068 - View Document
	We present first massively parallel (MPC) algorithms and hardness of approximation results for computing Single-Linkage Clustering of n input d-dimensional vectors under Hamming, `1 , `2 and `1 distances. All our algorit DocID: 1tRmH - View Document
	Hardness and Approximation of The Asynchronous Border Minimization Problem (Extended Abstract) Alexandru Popa1 , Prudence W.H. Wong2 , and Fencol C.C. Yung2 1 DocID: 1suK4 - View Document
	Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014 DocID: 1rdLy - View Document