Under the asymptotic rank conjecture, the chromatic number of an n-vertex graph can be computed deterministically in O(1.99982^n) time.
