On the Usefulness of Predicates

@article{Austrin2012OnTU,
  title={On the Usefulness of Predicates},
  author={Per Austrin and Johan H{\aa}stad},
  journal={2012 IEEE 27th Conference on Computational Complexity},
  year={2012},
  pages={53-63}
}
Motivated by the pervasiveness of strong inapproximability results for Max-CSPs, we introduce a relaxed notion of an approximate solution of a Max-CSP. In this relaxed version, loosely speaking, the algorithm is allowed to replace the constraints of an instance by some other (possibly real-valued) constraints, and then only needs to satisfy as many of the new constraints as possible. To be more precise, we introduce the following notion of a predicate P being useful for a (real-valued… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
1 Extracted Citations
5 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-5 of 5 references

Similar Papers

Loading similar papers…