Ideas & society2026 · shared on Hacker News
Breaking the 2^n Barrier for Graph k-Coloring
Explore Breaking the 2^n Barrier for Graph k-Coloring, its original source and Hacker News discussions. Discover community perspectives and save it to your reading list.
GO BEYOND THE ABSTRACT
The conversation around the idea.
Original Hacker News threads. Different perspectives, questions, and things worth thinking about.
Showing up to 100 related threads. A paper may appear in a comment rather than the original submission.
Links found in the discussion
Up to 50 recent source links, in HN item order.
Ymatt_d ·
k-Coloring is Faster than Computing the Chromatic Number
1 points0 comments
Yin_between ·
Breaking the 2^n Barrier for Graph k-Coloring
1 points0 comments