NP-hard SAT and CSP problems which admit exponentially improved algorithmsdl.acm.org5 points·cevi··1 commentOpen articleSaveView on HN