Simple analysis of graph tests for linearity and PCP
暂无分享,去创建一个
[1] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..
[2] Noam Nisan,et al. Hardness vs Randomness , 1994, J. Comput. Syst. Sci..
[3] Lars Engebretsen. The Non-approximability of Non-Boolean Predicates , 2001, RANDOM-APPROX.
[4] Luca Trevisan,et al. A PCP characterization of NP with optimal amortized query complexity , 2000, STOC '00.
[5] Ran Raz. A Parallel Repetition Theorem , 1998, SIAM J. Comput..
[6] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[7] László Lovász,et al. Interactive proofs and the hardness of approximating cliques , 1996, JACM.
[8] Marcos A. Kiwi,et al. Probabilistically checkable proofs and the testing of hadamard-like codes , 1996 .
[9] Noga Alon,et al. The Probabilistic Method, Second Edition , 2004 .
[10] Mihir Bellare,et al. Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[11] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[12] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[13] Mihir Bellare,et al. Linearity testing in characteristic two , 1996, IEEE Trans. Inf. Theory.
[14] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[15] Yonatan Aumann,et al. Linear-Consistency Testing , 2001, J. Comput. Syst. Sci..