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?
Isn't 3-SAT NP-complete?
Isn't 3-SAT NP-complete?