NP-hard SAT and CSP problems which admit exponentially improved algorithmsdl.acm.org5 pointscevi5 years ago