Change search
ReferencesLink to record
Permanent link

Direct link
Approximation Resistance on Satisfiable Instances for Predicates Strictly Dominating Parity
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0002-1600-5290
2012 (English)Report (Other academic)
Abstract [en]

In this paper, we study the approximability of Max CSP(P) where P is a Boolean predicate. We prove that assuming Khot’s d-to-1 Conjecture, if the set of accepting inputs of P strictly contains all inputs with even (or odd) parity, then it is NP-hard to approximate MaxCSP(P) better than the simple random assignment algorithm even on satisfiable instances.This is a generalization of a work by O’Donnell and Wu which proved that it is NP-hard to approximate satisfiable instances of Max CSP(NTW) beyond 5/8 + epsilon for any epsilon > 0 based on Khot’s d-to-1 Conjecture, where NTW is the “Not Two” predicate of size 3.

Place, publisher, year, edition, pages
2012. , 21 p.
, Electronic Colloquium on Computational Complexity (ECCC), ISSN 1433-8092 ; 40
Keyword [en]
pcp, approximation, d-to-1, perfect completeness
National Category
Computer Science
URN: urn:nbn:se:kth:diva-108165OAI: diva2:579115
EU, European Research Council, 6853

QC 20130109

Available from: 2013-01-09 Created: 2012-12-19 Last updated: 2013-01-09Bibliographically approved

Open Access in DiVA

tr12-040(837 kB)91 downloads
File information
File name FULLTEXT01.pdfFile size 837 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Search in DiVA

By author/editor
Huang, Sangxia
By organisation
Theoretical Computer Science, TCS
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 91 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 40 hits
ReferencesLink to record
Permanent link

Direct link