Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses

Adam Klivans, Dieter van Melkebeek. Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. In STOC. pages 659-667, 1999. [doi]

Abstract

Abstract is missing.