Probabilistic checking of proofs: A new characterization of NPSanjeev AroraShmuel Safra1998Journal of the ACM
O(√log n) approximation to sparsest cut in õ(n2) timeSanjeev AroraElad Hazanet al.2010SIAM Journal on Computing