Breaking the 2^n Barrier for Graph k-Coloring | Hacker News Reader