@inproceedings{STOC-1999-KlivansM,
	author        = "Adam Klivans and Dieter van Melkebeek",
	booktitle     = "{Proceedings of the 31st Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/301250.301428",
	isbn          = "1-58113-067-8",
	pages         = "659--667",
	publisher     = "{ACM}",
	title         = "{Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses}",
	year          = 1999,
}