NP-hard SAT and CSP problems which admit exponentially improved algorithms | Heykuki News