暂无分享,去创建一个
[1] Mihir Bellare,et al. Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[2] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[3] Luca Trevisan. Parallel Approximation Algorithms by Positive Linear Programming , 1998, Algorithmica.
[4] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[5] Bryna Kra,et al. The Green-Tao Theorem on arithmetic progressions in the primes: an ergodic point of view , 2005 .
[6] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[7] Yuval Rabani,et al. ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).
[8] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[9] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[10] W. T. Gowers,et al. A New Proof of Szemerédi's Theorem for Arithmetic Progressions of Length Four , 1998 .
[11] S. Safra,et al. On the hardness of approximating minimum vertex cover , 2005 .
[12] Atri Rudra,et al. Testing low-degree polynomials over prime fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[13] Noga Alon,et al. Testing Low-Degree Polynomials over GF(2( , 2003, RANDOM-APPROX.
[14] Nathan Linial,et al. The influence of variables on Boolean functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[15] Luca Trevisan,et al. Inapproximability of Combinatorial Optimization Problems , 2004, Electron. Colloquium Comput. Complex..
[16] Jonas Holmerin,et al. More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP , 2008, Random Struct. Algorithms.
[17] Gustav Hast. Approximating - Outperforming a Random Assignment with Almost a Linear Factor , 2005, ICALP.
[18] 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).
[19] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..
[20] Dana Ron,et al. Testing polynomials over general fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[21] Luca Trevisan,et al. Recycling queries in PCPs and in linearity tests (extended abstract) , 1998, STOC '98.
[22] Avi Wigderson,et al. Simple analysis of graph tests for linearity and PCP , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.
[23] Mihir Bellare,et al. Linearity testing in characteristic two , 1996, IEEE Trans. Inf. Theory.
[24] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[25] Subhash Khot,et al. Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[26] Guy Kindler,et al. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[27] Arild Stubhaug. Acta Mathematica , 1886, Nature.
[28] Bryna Kra,et al. Nonconventional ergodic averages and nilmanifolds , 2005 .
[29] Luca Trevisan,et al. Non-approximability results for optimization problems on bounded degree instances , 2001, STOC '01.
[30] Yonatan Aumann,et al. Linear Consistency Testing , 1999, RANDOM-APPROX.
[31] Nisheeth K. Vishnoi,et al. The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1 , 2005, FOCS.
[32] W. T. Gowers,et al. A NEW PROOF OF SZEMER ´ EDI'S THEOREM , 2001 .
[33] Luca Trevisan,et al. A PCP characterization of NP with optimal amortized query complexity , 2000, STOC '00.
[34] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[35] Subhash Khot. On the power of unique 2-prover 1-round games , 2002, STOC '02.
[36] Uriel Feige,et al. Approximation thresholds for combinatorial optimization problems , 2003, ArXiv.
[37] T. Tao,et al. The primes contain arbitrarily long arithmetic progressions , 2004, math/0404188.
[38] Ben Green,et al. AN INVERSE THEOREM FOR THE GOWERS U4-NORM , 2005, Glasgow Mathematical Journal.
[39] Sanjeev Arora. How NP got a new definition: a survey of probabilistically checkable proofs , 2003, ArXiv.