Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
scientific article; zbMATH DE number 6631113