A note on the asymptotics and computational complexity of graph distinguishability

Electronic Journal of Combinatorics

Volumn 5, Issue 1, 1998, Pages

  Russell, Alexander ^a   Sundaram, Ravi ^b  

^a University of Texas at Austin   (United States)

^b Delta Global Trading   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 2442649118     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1361     Document Type: Article

References (12)

1. Michael O. Albertson and Karen L. Collins. Symmetry breaking in graphs. Electronic Journal of Combinatorics, 3, 1996. R18.
2. Noga Alon and Joel H. Spencer. The Probabilistic Method. John Wiley & Sons, Inc., 1992.
3. László Babai and Shlomo Moran. Arthur-merlin games: a randomized proof system, and a hierarchy of complexity classes. Journal of Computer and System Sciences, 36(2):254-276, 1988.
4. José Luis Balcázar, Josep Díaz, and Joaquim Gabarró. Structural Complexity I, volume 11 of EATCS Monographs on Computer Science. Springer-Verlag, Berlin, 1988.
5. José Luis Balcázar, Josep Díaz, and Joaquim Gabarró. Structural Complexity II, volume 22 of EATCS Monographs on Computer Science. Springer-Verlag, Berlin, 1990.
6. Ravi Boppana, Johan Håstad, and Stathis Zachos. Does co-NP have short interactive proofs? Information Processing Letters, 25:127-132, 1981.
7. Shafi Goldwasser, Silvio Micali, and Charles Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal of Computing, 18(1):186-208, February 1989.
8. Shafi Goldwasser and Michael Sipser. Private coins versus public coins in interactive proof systems. Advances in Computing Research, 5:73-90, 1989.
9. Johannes Köbler, Uwe Schöning, and Jacobo Torán. The Graph Isomorphism Problem: Its Structural Complexity. Progress in Theoretical Computer Science. Birkhäuser, Boston, 1993.
10. Clemens Lautemann. BPP and the polynomial hierarchy. Information Processing Letters, 17:215-217, 1983.
11. Alexander Russell and Ravi Sundaram. Symmetric alternation captures BPP. Computational Complexity, 6, 1996.
12. Michael Sipser. A complexity theoretic approach to randomness. In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pages 330-335, Boston, Massachusetts, 25-27 April 1983.