Assertion: graph isomorphism | /r/AtLocation | quasi-polynomial time
Facets:
value: i.e., time $\o(n^{(\log
type: OTHER
Source sentences:
text: Babai has tentatively claimed (the proof isn't yet fully vetted, and so he's being careful) that graph isomorphism is in quasi-polynomial time, i.e., time $\O(n^{(\log n)^c})$ for some constant $c$.