Probabilistically checkable proofs with low amortized query complexity
暂无分享,去创建一个
[1] Maria J. Serna,et al. The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming , 1998, STACS.
[2] Lars Engebretsen,et al. Clique Is Hard To Approximate Within , 2000 .
[3] David P. Williamson,et al. A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction , 1997, STOC '97.
[4] Luca Trevisan,et al. Gadgets, approximation, and linear programming , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[5] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[6] Nadia Creignou. A Dichotomy Theorem for Maximum Generalized Satisfiability Problems , 1995, J. Comput. Syst. Sci..
[7] Luca TrevisanyAugust. Approximating Satissable Satissability Problems , 1997 .
[8] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[9] János Komlós,et al. An 0(n log n) sorting network , 1983, STOC.
[10] Sanjeev Arora,et al. Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[11] David Zuckerman,et al. On Unapproximable Versions of NP-Complete Problems , 1996, SIAM J. Comput..
[12] Mihir Bellare,et al. Improved non-approximability results , 1994, STOC '94.
[13] Uriel Feige,et al. Two-Prover Protocols - Low Error at Affordable Rates , 2000, SIAM J. Comput..
[14] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..
[15] Luca Trevisan. Approximating Satisfiable Satisfiability Problems , 2000, Algorithmica.
[16] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.
[17] Russell Impagliazzo,et al. How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.
[18] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[19] Luca Trevisan,et al. Recycling queries in PCPs and in linearity tests (extended abstract) , 1998, STOC '98.
[20] Johan Håstad. Testing of the long code and hardness for clique , 1996, STOC '96.
[21] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[22] M. Bellare,et al. Efficient probabilistic checkable proofs and applications to approximation , 1994, STOC '94.
[23] Luca Trevisan. Approximating Satisfiable Satisfiability Problems (Extended Abstract) , 1997, ESA.
[24] E. Szemerédi,et al. O(n LOG n) SORTING NETWORK. , 1983 .
[25] Luca Trevisan. Parallel Approximation Algorithms by Positive Linear Programming , 1998, Algorithmica.
[26] Carsten Lund,et al. Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.
[27] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[28] László Lovász,et al. Interactive proofs and the hardness of approximating cliques , 1996, JACM.
[29] Uri Zwick,et al. Finding almost-satisfying assignments , 1998, STOC '98.
[30] Uri Zwick,et al. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint , 1998, SODA '98.
[31] Rajeev Motwani,et al. On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[32] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[33] Johan Håstad,et al. Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.