# Every 2-csp Allows Nontrivial Approximation

@article{Hstad2008Every2A,
title={Every 2-csp Allows Nontrivial Approximation},
journal={computational complexity},
year={2008},
volume={17},
pages={549-566}
}
We use semidefinite programming to prove that any constraint satisfaction problem in two variables over any domain allows an efficient approximation algorithm that does better than picking a random assignment. Specifically we consider the case when each variable can take values in [d] and that each constraint rejects t out of the d 2 possible input pairs. Then, for some universal constant c, we can, in probabilistic polynomial time, find an assignment whose objective value is, in expectation… CONTINUE READING

#### From This Paper

##### Figures, tables, results, connections, and topics extracted from this paper.
2 Extracted Citations
27 Extracted References
Similar Papers

#### Citing Papers

##### Publications influenced by this paper.
Showing 1-2 of 2 extracted citations

#### Referenced Papers

##### Publications referenced by this paper.
Showing 1-10 of 27 references
Highly Influential
5 Excerpts
Highly Influential
5 Excerpts

## The complexity of theorem proving procedures

• S. Cook
• In 3rd Annual ACM Symposium on Theory of…
• 1971
Highly Influential
11 Excerpts
1 Excerpt
2 Excerpts
1 Excerpt