"(2+ε)-SAT is NP-hard."

Per Austrin, Venkatesan Guruswami, Johan Håstad (2013)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2022-09-27

a service of  Schloss Dagstuhl - Leibniz Center for Informatics