"Optimal algorithms and inapproximability results for every CSP?"

Prasad Raghavendra (2008)

Details and statistics

DOI: 10.1145/1374376.1374414

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-14

a service of  Schloss Dagstuhl - Leibniz Center for Informatics