Zero Knowledge and the Chromatic Number

Journal of Computer and System Sciences

Volumn 57, Issue 2, 1998, Pages 187-199

  Feige, Uriel ^a   Kilian, Joe ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; POLYNOMIALS;

CHROMATIC NUMBER; ZERO KNOWLEDGE PROOF SYSTEMS;

COMPUTATIONAL COMPLEXITY;

EID: 0032178928     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1998.1587     Document Type: Article

References (31)

1. N. Alon, U. Feige, A. Wigderson, and D. Zuckerman, Derandomized graph products, Comput. Complexity 5 (1995), 60-75.
2. N. Alon and J. Spencer, "The Probabilistic Method," Wiley, New York, 1992.
3. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and intractability of approximation problems, in "Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992," pp. 13-22.
4. S. Arora and S. Safra, Probabilistic checking of proofs: A new characterization of NP, in "Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992," pp. 2-13.
5. M. Bellare, O. Goldreich, and M. Sudan, Free bits, PCPs and nonapproximability - Towards tight results, in "Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1995," pp. 422-431.
6. M. Bellare, S. Goldwasser, C. Lund, and A. Russell, Efficient multiprover interactive proofs with applications to approximations problems, in "Proc. 25th ACM Symp. on Theory of Computing, 1993," pp. 113-131.
7. M. Bellare and M. Sudan, Improved non-approximability results, in "Proc. 26th ACM Symp. on Theory of Computing, 1994," pp. 184-193.
8. P. Berman and G. Schnitger, On the complexity of approximating the independent set problem, Inform, and Comput. 96(1) (1992), 77-94.
9. R. Boppana and M. Halldorsson, Approximating maximum independent sets by excluding subgraphs, BIT 32 (1992), 180-196.
10. A. Blum, "Algorithms for Approximate Graph Coloring," Ph.D. thesis, Massachusetts Institute of Technology, (1991), [Also in MIT/LCS/TR-506, June 1991].
11. C. Dwork, U. Feige, J. Kilian, M. Noar, and S. Safra, Low communication, 2-prover zero-knowledge proofs for NP, in "Advances in Cryptology: Crypto '92," pp. 217-229.
12. U. Feige, Randomized graph products, chromatic numbers, and the Lovasz θ-function, in "Proceedings of 27th Symposium on the Theory of Computing, 1995," pp. 635-640.
13. U. Feige, S. Goldwasser, L. Lovasz, S. Safra, and M. Szegedy, Interactive proofs and the hardness of approximating cliques, J. Assoc. Comput. Mach. 43(2) (1996), 268-292.
14. U. Feige and J. Kilian, Two prover protocols-low error at affordable rates, in "Proc. 26th ACM Symp. on Theory of Computing, 1994," pp. 72-183.
15. U. Feige and J. Kilian, Zero knowlegde and the chromatic number (preliminary version), in "Proc. of 11th IEEE Conference on Computational Complexity, 1996" pp. 278-287, IEEE Comput. Soc. Press, New York, 1996.
16. M. Furer, Improved hardness results for approximating the chromatic number, in "Proc. 36th IEEE Symp. on Foundations of Computer Science, 1995," pp. 414-421.
17. M. R. Garey and D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, San Francisco, 1995.
18. M. R. Garey and D. S. Johnson, The complexity of near-optimal graph coloring, J. Assoc. Comput. Mach. 23 (1976), 43-49.
19. O. Goldreich, S. Micali, and A. Wigderson, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proofs, J. Assoc. Comput. Mach. 38(3) (1991), 691-729.
20. M. Halldorsson, A still better performance guarantee for approximate graph coloring, Inform. Process. Lett. 45 (1993), 19-23.
21. J. Håstad, Testing of the long code and hardness for clique, in "Proc. 28th ACM Symp. on Theory of Computing, 1996," pp. 11-19.
22. 1-ε, in "Proc. 37th IEEE Symp. on Foundations of Computer Science, 1996," pp. 627-636.
23. R. M. Karp, Reductibility among combinatorial problems, in "Complexity of Computer Computation" (Miller and Thatcher, Eds.), pp. 85-103, Plenum, New York, 1972.
24. S. Khanna, N. Linial, and S. Safra, On the hardness of approximating the chromatic number, in "Proceedings of the 2nd Israel Symposium on Theory and Computing Systems, ISTCS," pp. 250-260, IEEE Comput. Soc. Press, New York, 1993.
25. J. Kilian and M. Naor, On the complexity of statistical reasoning, in "Proceedings, Israeli Symposium on Theory of Computing and Systems, 1995," pp. 209-217.
26. N. Linial and U. Vazirani, Graph products and chromatic numbers, in "Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989," pp. 124-128.
27. L. Lovasz, On the ratio of optimal integral and fractional covers, Discrete Math. 13 (1975), 383-390.
28. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, J. Assoc. Comput. Mach. 41(5) (1994), 960-981.
29. E. Petrank, The hardness of approximation: Gap location, Comput. Complexity 4 (1994), 133-157.
30. R. Raz, A parallel repetition theorem, in "Proceedings of the 27th Symposium on Theory of Computing, 1995," pp. 447-456.
31. D. Zuckerman, Simulating BPP using a general weak random source, in "Proc. 32nd IEEE Symp. on Foundations of Computer Science, 1991," pp. 79-89.