Klivans, Adam R.; van Melkebeek, Dieter Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. (English) Zbl 1016.68060 SIAM J. Comput. 31, No. 5, 1501-1526 (2002). Cited in 39 Documents MSC: 68R10 Graph theory (including graph drawing) in computer science 05C99 Graph theory Keywords:derandomization; pseudorandomness; graph isomorphism; interactive proofs; Arthur-Merlin games; hardness versus randomness; universal traversal sequences; unique satisfiability; learning theory; rigid matrices PDF BibTeX XML Cite \textit{A. R. Klivans} and \textit{D. van Melkebeek}, SIAM J. Comput. 31, No. 5, 1501--1526 (2002; Zbl 1016.68060) Full Text: DOI