Graph Nonisomorphism Has Subexponential Size Proofs Unless The Polynomial-Time Hierarchy Collapses (1998)

by Adam R. Klivans , Dieter Van Melkebeek
Venue:SIAM Journal on Computing
Citations:108 - 6 self