两两独立的近似抵抗谓词
Approximation Resistant Predicates From Pairwise Independence
摘要：
研究了定义域$[q]$中$k$变量上谓词的可逼近性，给出了唯一对策猜想下此类谓词抗逼近的一个新的充分条件.具体来说，我们证明了一个谓词$P$是近似抵抗，如果存在一个平衡的两两独立分布在$[q]^k$的支持是包含在一组满足分配给$P$。
英文摘要：
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$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
