### 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 language | English (US) |
---|---|

Title of host publication | ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science |

Pages | 187-196 |

Number of pages | 10 |

DOIs | |

State | Published - 2013 |

Event | 2013 4th ACM Conference on Innovations in Theoretical Computer Science, ITCS 2013 - Berkeley, CA, United States Duration: Jan 9 2013 → Jan 12 2013 |

### Other

Other | 2013 4th ACM Conference on Innovations in Theoretical Computer Science, ITCS 2013 |
---|---|

Country | United States |

City | Berkeley, CA |

Period | 1/9/13 → 1/12/13 |

### Fingerprint

### Keywords

- approximation resistance
- unique games conjecture

### ASJC Scopus subject areas

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

### Cite this

*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.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*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

}

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

SN - 9781450318594

SP - 187

EP - 196

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

ER -