Author:
Khot Subhash,Ponnuswami Ashok Kumar
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Arora, S.: Probabilistic checking of proofs and the hardness of approximation problems. Ph.D. thesis, UC Berkeley (1994)
2. Arora, S., Lund, C., Motawani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of the ACM 45(3), 501–555 (1998)
3. Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of $\mbox{NP}$ . Journal of the ACM 45(1), 70–122 (1998)
4. Bellare, M., Goldreich, O., Sudan, M.: Free bits, PCPs and non-approximability. Electronic Colloquium on Computational Complexity, Technical Report TR95-024 (1995)
5. Bellare, M., Goldwasser, S., Lund, C., Russell, A.: Efficient probabilistic checkable proofs and applications to approximation. In: Proc. 25th ACM Symposium on Theory of Computing, pp. 294–304 (1993)
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献