Approximation Resistant Predicates From Pairwise Independence

Simple item page
dc.creatorAustrin, Per
dc.creatorMossel, Elchanan
dc.date2008-02-15
dc.date.accessioned2026-07-07T09:21:24Z
dc.date.available2026-07-07T09:21:24Z
dc.descriptionWe 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$.
dc.identifierhttps://arxiv.org/abs/0802.2300
dc.identifierhttp://arxiv.org/abs/0802.2300
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/155007
dc.subjectComputational Complexity
dc.titleApproximation Resistant Predicates From Pairwise Independence
dc.typetext

Files

Collections

arXiv