logoalt Hacker News

dooglius • yesterday at 10:21 PM • 1 reply • view on HN

The proof appears to be a sub-exponential algorithm for #3-SAT not just 3-SAT, I think this is considered a much stronger result?


Replies

geysersam • yesterday at 10:42 PM

Isn't 3-SAT NP-complete?

➕ show 2 replies