Query-efficient checking of proofs and improved PCP characterizations of NP
暂无分享,去创建一个
[1] Carsten Lund,et al. Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.
[2] Uriel Feige,et al. Two-Prover Protocols - Low Error at Affordable Rates , 2000, SIAM J. Comput..
[3] Uri Zwick,et al. A 7/8-approximation algorithm for MAX 3SAT? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[4] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[5] László Lovász,et al. Interactive proofs and the hardness of approximating cliques , 1996, JACM.
[6] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[7] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[8] Lars Engebretsen,et al. Clique Is Hard To Approximate Within , 2000 .
[9] Luca Trevisan,et al. Probabilistically checkable proofs with low amortized query complexity , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[10] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..
[11] Luca Trevisan. Approximating Satisfiable Satisfiability Problems , 2000, Algorithmica.
[12] Luca Trevisan,et al. Positive Linear Programming, Parallel Approximation and PCP's , 1996, ESA.
[13] Carsten Lund,et al. On the hardness of approximating minimization problems , 1994, JACM.
[14] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.
[15] Madhu Sudan,et al. Improved Low-Degree Testing and its Applications , 1997, STOC '97.
[16] Adi Shamir,et al. Fully parallelized multi prover protocols for NEXP-time , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[17] Venkatesan Guruswami,et al. A tight characterization of NP with 3 query PCPs , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[18] Mihir Bellare,et al. Improved non-approximability results , 1994, STOC '94.
[19] Uri Zwick,et al. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint , 1998, SODA '98.
[20] Ran Raz,et al. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.
[21] M. Bellare,et al. Efficient probabilistic checkable proofs and applications to approximation , 1994, STOC '94.
[22] Luca Trevisan,et al. Gadgets, Approximation, and Linear Programming , 2000, SIAM J. Comput..
[23] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[24] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[25] László Lovász,et al. Two-prover one-round proof systems: their power and their problems (extended abstract) , 1992, STOC '92.
[26] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[27] Luca Trevisan,et al. Recycling queries in PCPs and in linearity tests (extended abstract) , 1998, STOC '98.
[28] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.