Proof Checking and Approximation: Towards Tight Results
暂无分享,去创建一个
[1] U. Feige. A threshold of ln n for approximating set cover , 1998, JACM.
[2] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[3] Johan Håstad. Testing of the long code and hardness for clique , 1996, STOC '96.
[4] Uriel Feige,et al. Zero knowledge and the chromatic number , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).
[5] Phokion G. Kolaitis. Hardness Of Approximations , 1996 .
[6] D. Hochbaum. Approximation Algorithms for NP-Hard Problems , 1996 .
[7] Sanjeev Arora,et al. Reductions, codes, PCPs, and inapproximability , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[8] Mihir Bellare,et al. Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[9] Martin Fürer,et al. Improved Hardness Results for Approximating the Chromatic Number , 1995, FOCS.
[10] Aravind Srinivasan,et al. Splitters and near-optimal derandomization , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[11] Sanjeev Arora. Probabilistic checking of proofs and hardness of approximation problems , 1995 .
[12] Uriel Feige,et al. Impossibility results for recycling random bits in two-prover proof systems , 1995, STOC '95.
[13] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[14] 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.
[15] Carsten Lund,et al. On the hardness of approximating minimization problems , 1994, JACM.
[16] David P. Williamson,et al. .879-approximation algorithms for MAX CUT and MAX 2SAT , 1994, STOC '94.
[17] Mihir Bellare,et al. Improved non-approximability results , 1994, STOC '94.
[18] M. Sudan. On the role of algebra in the efficient verification of proofs , 1994 .
[19] Carsten Lund,et al. Efficient probabilistic checkable proofs and applications to approximation , 1994, STOC '94.
[20] László Babai,et al. Transparent Proofs and Limits to Approximation , 1994 .
[21] Pierluigi Crescenzi,et al. A compendium of NP optimization problems , 1994, WWW Spring 1994.
[22] David B. Shmoys,et al. Computing near-optimal solutions to combinatorial optimization problems , 1994, Combinatorial Optimization.
[23] Nathan Linial,et al. On the Hardness of Approximating the Chromatic Number , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.
[24] David Zuckerman,et al. NP-complete problems have a version that's hard to approximate , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[25] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[26] Mihalis Yannakakis,et al. On the approximation of maximum satisfiability , 1992, SODA '92.
[27] Moni Naor,et al. Low Communication 2-Prover Zero-Knowledge Proofs for NP , 1992, CRYPTO.
[28] László Lovász,et al. Two-prover one-round proof systems: their power and their problems (extended abstract) , 1992, STOC '92.
[29] László Lovász,et al. Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[30] Adi Shamir,et al. Fully parallelized multi prover protocols for NEXP-time , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[31] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[32] Ravi B. Boppana,et al. Approximating maximum independent sets by excluding subgraphs , 1990, BIT.
[33] R. Boppana. Approximating Maximum Independent Sets by Excluding Subgraphs 1 , 1990 .
[34] Piotr Berman,et al. On the Complexity of Approximating the Independent Set Problem , 1989, Inf. Comput..
[35] Avi Wigderson,et al. Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.
[36] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[37] Ewald Speckenmeyer,et al. Some Further Approximation Algorithms for the Vertex Cover Problem , 1983, CAAP.
[38] Reuven Bar-Yehuda,et al. A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.
[39] Reuven Bar-Yehuda,et al. A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem , 1981, J. Algorithms.
[40] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[41] David S. Johnson,et al. The Complexity of Near-Optimal Graph Coloring , 1976, J. ACM.
[42] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..
[43] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[44] Richard M. Karp,et al. Reducibility among combinatorial problems" in complexity of computer computations , 1972 .
[45] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.