A characterization of approximation resistance for even k-partite CSPs

Per Austrin, Subhash Khot

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A constraint satisfaction problem (CSP) is said to be approximation resistant if it is hard to approximate better than the trivial algorithm which picks a uniformly random assignment. Assuming the Unique Games Conjecture, we give a characterization of approximation resistance for k-partite CSPs defined by an even predicate.

Original languageEnglish (US)
Title of host publicationITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science
Pages187-196
Number of pages10
DOIs
StatePublished - 2013
Event2013 4th ACM Conference on Innovations in Theoretical Computer Science, ITCS 2013 - Berkeley, CA, United States
Duration: Jan 9 2013Jan 12 2013

Other

Other2013 4th ACM Conference on Innovations in Theoretical Computer Science, ITCS 2013
CountryUnited States
CityBerkeley, CA
Period1/9/131/12/13

Fingerprint

Constraint satisfaction problems
Approximation
Constraint satisfaction problem
Random assignment

Keywords

  • approximation resistance
  • unique games conjecture

ASJC Scopus subject areas

  • Management of Technology and Innovation
  • Computer Science (miscellaneous)

Cite this

Austrin, P., & Khot, S. (2013). A characterization of approximation resistance for even k-partite CSPs. In ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science (pp. 187-196) https://doi.org/10.1145/2422436.2422459

A characterization of approximation resistance for even k-partite CSPs. / Austrin, Per; Khot, Subhash.

ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science. 2013. p. 187-196.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Austrin, P & Khot, S 2013, A characterization of approximation resistance for even k-partite CSPs. in ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science. pp. 187-196, 2013 4th ACM Conference on Innovations in Theoretical Computer Science, ITCS 2013, Berkeley, CA, United States, 1/9/13. https://doi.org/10.1145/2422436.2422459
Austrin P, Khot S. A characterization of approximation resistance for even k-partite CSPs. In ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science. 2013. p. 187-196 https://doi.org/10.1145/2422436.2422459
Austrin, Per ; Khot, Subhash. / A characterization of approximation resistance for even k-partite CSPs. ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science. 2013. pp. 187-196
@inproceedings{2acf40ac746a416ea644e0a4a26f38de,
title = "A characterization of approximation resistance for even k-partite CSPs",
abstract = "A constraint satisfaction problem (CSP) is said to be approximation resistant if it is hard to approximate better than the trivial algorithm which picks a uniformly random assignment. Assuming the Unique Games Conjecture, we give a characterization of approximation resistance for k-partite CSPs defined by an even predicate.",
keywords = "approximation resistance, unique games conjecture",
author = "Per Austrin and Subhash Khot",
year = "2013",
doi = "10.1145/2422436.2422459",
language = "English (US)",
isbn = "9781450318594",
pages = "187--196",
booktitle = "ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science",

}

TY - GEN

T1 - A characterization of approximation resistance for even k-partite CSPs

AU - Austrin, Per

AU - Khot, Subhash

PY - 2013

Y1 - 2013

N2 - A constraint satisfaction problem (CSP) is said to be approximation resistant if it is hard to approximate better than the trivial algorithm which picks a uniformly random assignment. Assuming the Unique Games Conjecture, we give a characterization of approximation resistance for k-partite CSPs defined by an even predicate.

AB - A constraint satisfaction problem (CSP) is said to be approximation resistant if it is hard to approximate better than the trivial algorithm which picks a uniformly random assignment. Assuming the Unique Games Conjecture, we give a characterization of approximation resistance for k-partite CSPs defined by an even predicate.

KW - approximation resistance

KW - unique games conjecture

UR - http://www.scopus.com/inward/record.url?scp=84873348647&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84873348647&partnerID=8YFLogxK

U2 - 10.1145/2422436.2422459

DO - 10.1145/2422436.2422459

M3 - Conference contribution

AN - SCOPUS:84873348647

SN - 9781450318594

SP - 187

EP - 196

BT - ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science

ER -