Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

CORR

2007

Springer

2007

Springer

An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables that maximises the number of satised constraints. Max CSP captures many well-known problems (such as Max k-SAT and Max Cut) and is consequently NP-hard. Thus, it is natural to study how restrictions on the allowed constraint types (or constraint language) aect the complexity and approximability of Max CSP. The PCP theorem is equivalent to the existence of a constraint language for which Max CSP has a hard gap at location 1, i.e. it is NP-hard to distinguish between satisable instances and instances where at most some constant fraction of the constraints are satisable. All constraint languages, for which the CSP problem (i.e., the problem of deciding whether all constraints can be satised) is currently known to be NP-hard, have a certain algebraic property. We prove that any constraint language with this ...

Related Content

Added |
18 Dec 2010 |

Updated |
18 Dec 2010 |

Type |
Journal |

Year |
2007 |

Where |
CORR |

Authors |
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen |

Comments (0)