Adam Klivans, Dieter van Melkebeek. Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. In STOC. pages 659-667, 1999. [doi]
@inproceedings{KlivansM99,
title = {Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses},
author = {Adam Klivans and Dieter van Melkebeek},
year = {1999},
doi = {10.1145/301250.301428},
url = {http://doi.acm.org/10.1145/301250.301428},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/KlivansM99},
cites = {0},
citedby = {0},
pages = {659-667},
booktitle = {STOC},
}