Author:
Aumann Yonatan,Håstad Johan,Rabin Michael O.,Sudan Madhu
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference15 articles.
1. Proof verification and the hardness of approximation problems;Arora;J. Assoc. Comput. Mach.,1998
2. Probabilistic checking of proofs: A new characterization of NP;Arora;J. Assoc. Comput. Mach.,1998
3. Y. Aumann, and, M. O. Rabin, manuscript, 1999.
4. Linearity testing in characteristic two;Bellare;IEEE Trans. Inform. Theory,1996
5. Free bits, PCPs, and non-approximability—Towards tight results;Bellare;SIAM J. Comput.,1998
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献