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]

Authors

Adam Klivans

This author has not been identified. Look up 'Adam Klivans' in Google

Dieter van Melkebeek

This author has not been identified. Look up 'Dieter van Melkebeek' in Google