(2+ε)-Sat Is NP-hard

Per Austrin, Venkatesan Guruswami, Johan Håstad. (2+ε)-Sat Is NP-hard. SIAM Journal on Computing, 46(5):1554-1573, 2017. [doi]

Abstract

Abstract is missing.