Free Bits, PCPs, and Nonapproximability-Towards Tight Results
暂无分享,去创建一个
[1] Gábor Tardos. Multi-prover Encoding Schemes and Three-prover Proof Systems , 1996, J. Comput. Syst. Sci..
[2] Reuven Bar-Yehuda,et al. A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.
[3] Mihir Bellare,et al. Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[4] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[5] Teofilo F. Gonzalez,et al. P-Complete Approximation Problems , 1976, J. ACM.
[6] David S. Johnson,et al. The Complexity of Near-Optimal Graph Coloring , 1976, J. ACM.
[7] Russell Impagliazzo,et al. How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.
[8] László Lovász,et al. Interactive proofs and the hardness of approximating cliques , 1996, JACM.
[9] Uriel Feige,et al. Randomized graph products, chromatic numbers, and Lovasz j-function , 1995, STOC '95.
[10] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[11] Uriel Feige,et al. Two-Prover Protocols - Low Error at Affordable Rates , 2000, SIAM J. Comput..
[12] Yacov Yacobi,et al. The Complexity of Promise Problems with Applications to Public-Key Cryptography , 1984, Inf. Control..
[13] Satissed Now Consider. Improved Approximation Algorithms for Maximum Cut and Satissability Problems Using Semideenite Programming , 1997 .
[14] Ewald Speckenmeyer,et al. Some Further Approximation Algorithms for the Vertex Cover Problem , 1983, CAAP.
[15] David Zuckerman,et al. On Unapproximable Versions of NP-Complete Problems , 1996, SIAM J. Comput..
[16] Richard M. Karp,et al. Reducibility among combinatorial problems" in complexity of computer computations , 1972 .
[17] Uriel Feige,et al. Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.
[18] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[19] David R. Karger,et al. Approximate graph coloring by semidefinite programming , 1998, JACM.
[20] GoldreichOded,et al. Free Bits, PCPs, and Nonapproximability---Towards Tight Results , 1998 .
[21] 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.
[22] Silvio Micali,et al. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[23] László Babai,et al. Trading group theory for randomness , 1985, STOC '85.
[24] David P. Williamsony. A New 3 4 -approximation Algorithm for Max Sat , 1994 .
[25] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[26] Adi Shamir,et al. Fully parallelized multi prover protocols for NEXP-time , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[27] Jacques Stern,et al. The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations , 1997, J. Comput. Syst. Sci..
[28] János Komlós,et al. Deterministic simulation in LOGSPACE , 1987, STOC.
[29] M. Bellare,et al. Efficient probabilistic checkable proofs and applications to approximation , 1994, STOC '94.
[30] Carsten Lund,et al. On the hardness of approximating minimization problems , 1994, JACM.
[31] Sanjeev Arora,et al. Reductions, codes, PCPs, and inapproximability , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[32] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..
[33] Mihir Bellare,et al. The complexity of approximating a nonlinear program , 1995, Math. Program..
[34] Nathan Linial,et al. On the Hardness of Approximating the Chromatic Number , 2000, Comb..
[35] A. Blum. ALGORITHMS FOR APPROXIMATE GRAPH COLORING , 1991 .
[36] Clemens Lautemann,et al. BPP and the Polynomial Hierarchy , 1983, Inf. Process. Lett..
[37] Ran Raz. A Parallel Repetition Theorem , 1998, SIAM J. Comput..
[38] Luca Trevisan,et al. Gadgets, approximation, and linear programming , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[39] Mihalis Yannakakis,et al. On the approximation of maximum satisfiability , 1992, SODA '92.
[40] Avi Wigderson,et al. Dispersers, deterministic amplification, and weak random sources , 1989, 30th Annual Symposium on Foundations of Computer Science.
[41] Carsten Lund,et al. Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[42] Pierluigi Crescenzi,et al. A compendium of NP optimization problems , 1994, WWW Spring 1994.
[43] Avi Wigderson,et al. Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.
[44] Ravi B. Boppana,et al. Approximating maximum independent sets by excluding subgraphs , 1990, BIT.
[45] Adi Shamir,et al. Fully Parallelized Multi-Prover Protocols for NEXP-Time , 1997, J. Comput. Syst. Sci..
[46] Daniel A. Spielman,et al. Nearly-linear size holographic proofs , 1994, STOC '94.
[47] Mihir Bellare,et al. Linearity testing in characteristic two , 1996, IEEE Trans. Inf. Theory.
[48] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[49] Leonard M. Adleman,et al. Two theorems on random polynomial time , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[50] Nabil Kahale,et al. On the second eigenvalue and linear expansion of regular graphs , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[51] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[52] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[53] Adi Shamir,et al. IP = PSPACE , 1992, JACM.
[54] Martin Fürer. Improved Hardness Results for Approximating the Chromatic Number , 1995, FOCS.
[55] László Lovász,et al. Two-prover one-round proof systems: their power and their problems (extended abstract) , 1992, STOC '92.
[56] Carsten Lund,et al. Proof verification and the intractability of approximation problems , 1992, FOCS 1992.
[57] Sanjeev Khanna,et al. On the Hardness of Approximating Max k-Cut and its Dual , 1997, Chic. J. Theor. Comput. Sci..
[58] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[59] Ravi B. Boppana,et al. Approximating maximum independent sets by excluding subgraphs , 1992, BIT Comput. Sci. Sect..
[60] David P. Williamson,et al. New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem , 1994, SIAM J. Discret. Math..
[61] Silvio Micali,et al. The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..
[62] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.
[63] Williamson , 1975 .
[64] László Lovász,et al. Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[65] Johan Håstad. Testing of the long code and hardness for clique , 1996, STOC '96.
[66] Uriel Feige,et al. Zero Knowledge and the Chromatic Number , 1998, J. Comput. Syst. Sci..
[67] Edoardo Amaldi,et al. The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations , 1995, Theor. Comput. Sci..
[68] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[69] Carsten Lund,et al. Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.
[70] Luca Trevisan,et al. To Weight or Not to Weight: Where is the Question? , 1996, ISTCS.
[71] Aviad Cohen Avi Wigderson. Dispersers , Deterministic Ampli cation , and Weak RandomSources , 1989 .
[72] Reuven Bar-Yehuda,et al. A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem , 1981, J. Algorithms.
[73] KahaleNabil. Eigenvalues and expansion of regular graphs , 1995 .
[74] Moni Naor,et al. The hardness of decoding linear codes with preprocessing , 1990, IEEE Trans. Inf. Theory.
[75] Reuven Bar-Yehuda,et al. On approximation problems related to the independent set and vertex cover problems , 1984, Discret. Appl. Math..
[76] Mihir Bellare,et al. Interactive proofs and approximation: reductions from two provers in one round , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.
[77] Uriel Feige. Randomized graph products, chromatic numbers, and the Lovász ϑ-function , 1997, Comb..
[78] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[79] David P. Williamson,et al. .879-approximation algorithms for MAX CUT and MAX 2SAT , 1994, STOC '94.
[80] Mihir Bellare,et al. Improved non-approximability results , 1994, STOC '94.
[81] Piotr Berman,et al. On the Complexity of Approximating the Independent Set Problem , 1989, Inf. Comput..
[82] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[83] Oded Goldreich,et al. On Completeness and Soundness in Interactive Proof Systems , 1989, Adv. Comput. Res..
[84] AroraSanjeev,et al. Probabilistic checking of proofs , 1998 .
[85] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[86] Uriel Feige,et al. Two prover protocols: low error at affordable rates , 1994, STOC '94.
[87] Dorit S. Hochbaum,et al. Efficient bounds for the stable set, vertex cover and set packing problems , 1983, Discret. Appl. Math..
[88] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[89] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[90] Alexander Lubotzky,et al. Explicit expanders and the Ramanujan conjectures , 1986, STOC '86.
[91] Shafi Goldwasser,et al. Private coins versus public coins in interactive proof systems , 1986, STOC '86.
[92] Amnon Ta-Shma. A Note on PCP vs. MIP , 1996, Inf. Process. Lett..
[93] N. S. Barnett,et al. Private communication , 1969 .
[94] Alon Itai,et al. On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..