Hacker News new | past | comments | ask | show | jobs | submit
dooglius | on: Three new discoveries in mathematics, computer science, and physics
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?
geysersam | parent
Isn't 3-SAT NP-complete?
loading story #50252256
loading story #50252230