Home
DCC eCatalog
Adam_R.__Klivans
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
