(January 15, 2017, update: On January 4, Babai retracted his claim that the new algorithm runs in quasi-polynomial time and then five ... For decades, the graph isomorphism problem has held a special ...

Imagine a graph ... complexity. • Determine if there exists a clique of size 50 but no clique of size 51. What researchers want to know: Computer scientists have not been able to prove that PH is ...