Approximation Resistant Predicates From Pairwise Independence

Details Approximation Resistant Predicates From Pairwise Independence Approximation Resistant Predicates From Pairwise Independence

2008-02-15

arxiv.org/abs/0802.2300v1

Computer Science

Computational Complexity

Scientific paper

We study the approximability of predicates on $k$ variables from a domain $[q]$, and give a new sufficient condition for such predicates to be approximation resistant under the Unique Games Conjecture. Specifically, we show that a predicate $P$ is approximation resistant if there exists a balanced pairwise independent distribution over $[q]^k$ whose support is contained in the set of satisfying assignments to $P$.

Affiliated with

Also associated with

No associations

Rating

Approximation Resistant Predicates From Pairwise Independence does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximation Resistant Predicates From Pairwise Independence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximation Resistant Predicates From Pairwise Independence will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-247948