Linear Consistency Testing
暂无分享,去创建一个
Yonatan Aumann | Madhu Sudan | Johan Håstad | Michael O. Rabin | M. Rabin | J. Håstad | M. Sudan | Y. Aumann
[1] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..
[2] Luca Trevisan,et al. Positive Linear Programming, Parallel Approximation and PCP's , 1996, ESA.
[3] Luca Trevisan,et al. A PCP characterization of NP with optimal amortized query complexity , 2000, STOC '00.
[4] Carsten Lund,et al. Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.
[5] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[6] Mihir Bellare,et al. Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[7] Uri Zwick,et al. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint , 1998, SODA '98.
[8] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[9] Sanjeev Arora,et al. Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[10] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[11] Mihir Bellare,et al. Linearity testing in characteristic two , 1996, IEEE Trans. Inf. Theory.
[12] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[13] M. Bellare,et al. Efficient probabilistic checkable proofs and applications to approximation , 1994, STOC '94.
[14] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[15] Luca Trevisan,et al. Recycling queries in PCPs and in linearity tests (extended abstract) , 1998, STOC '98.
[16] SudanMadhu,et al. Proof verification and the hardness of approximation problems , 1998 .
[17] Manuel Blum,et al. Designing programs that check their work , 1989, STOC '89.