Testing of the long code and hardness for clique
暂无分享,去创建一个
[1] Mihir Bellare,et al. Improved non-approximability results , 1994, STOC '94.
[2] Uriel Feige,et al. Two prover protocols: low error at affordable rates , 1994, STOC '94.
[3] László Lovász,et al. Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[4] Uriel Feige,et al. Randomized graph products, chromatic numbers, and Lovasz j-function , 1995, STOC '95.
[5] Carsten Lund,et al. Proof verification and the intractability of approximation problems , 1992, FOCS 1992.
[6] Mihir Bellare,et al. Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[7] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[8] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[9] Carsten Lund,et al. Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.
[10] Ravi B. Boppana,et al. Approximating maximum independent sets by excluding subgraphs , 1990, BIT.
[11] 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.