Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Approximation resistant predicates from pairwise independence
KTH, Skolan för datavetenskap och kommunikation (CSC), Teoretisk datalogi, TCS.ORCID-id: 0000-0001-8217-0158
2008 (engelsk)Inngår i: 23rd Annual IEEE Conference on Computational Complexity, proceedings, 2008, s. 249-258Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

We study the approximability of predicates on k variables from a domain [q], and give a new sufficient condition for such predicates to be approximation resistant under the Unique Games Conjecture. Specifically, we show that a predicate P is approximation resistant if there exists a balanced pairwise independent distribution over [q](k) whose support is contained in the set of satisfying assignments to P. Using constructions of pairwise independent distributions this result implies that For general k >= 3 and q >= 2, the MAX k-CSP(q) problem is UG-hard to approximate within O(kq(2))q(k) + epsilon. For the special case of q = 2, i.e., boolean variables, we can sharpen this bound to (k + O(k(0.525)))/2(k) + epsilon, improving upon the best previous bound of 2k/2(k) + epsilon (Samorodnitsky and Trevisan, STOC'06) by essentially a factor 2. Finally, again for q = 2, assuming that the famous Hadamard Conjecture is true, this can be improved even further and the O(k(0.521)) term can be replaced by the constant 4.

sted, utgiver, år, opplag, sider
2008. s. 249-258
Serie
Annual IEEE Conference on Computational Complexity, ISSN 1093-0159
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-38375DOI: 10.1109/CCC.2008.20ISI: 000257941800024Scopus ID: 2-s2.0-51749120357ISBN: 978-0-7695-3169-4 (tryckt)OAI: oai:DiVA.org:kth-38375DiVA, id: diva2:437296
Konferanse
23rd Annual IEEE Conference on Computational Complexity Location: Univ Maryland, College Pk, MD Date: JUN 23-26, 2008
Tilgjengelig fra: 2011-08-29 Laget: 2011-08-25 Sist oppdatert: 2018-01-12bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Austrin, Per

Søk i DiVA

Av forfatter/redaktør
Austrin, Per
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 74 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf