The Non-approximability of Non-Boolean Predicates

@inproceedings{Engebretsen2001TheNO,
  title={The Non-approximability of Non-Boolean Predicates},
  author={Lars Engebretsen},
  booktitle={RANDOM-APPROX},
  year={2001}
}
Abstract. Constraint satisfaction programs where each constraint depends on a constant number of variables have the following property: The randomized algorithm that guesses an assignment uniformly at random satisfies an expected constant fraction of the constraints. By combining constructions from interactive proof systems with harmonic analysis over finite groups, Håstad showed that for several constraint satisfaction programs this naive algorithm is essentially the best possible unless P… CONTINUE READING
Highly Cited
This paper has 32 citations. REVIEW CITATIONS