Computer science2021 · shared on Hacker News
NP-hard SAT and CSP problems which admit exponentially improved algorithms
Explore NP-hard SAT and CSP problems which admit exponentially improved algorithms, 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.
Ycevi ·
NP-hard SAT and CSP problems which admit exponentially improved algorithms
5 points1 comments