1, and sufficient..."> 1, and sufficient..."> 1, and sufficient...">
DeepAI AI Chat
Log In Sign Up

Reduction From Non-Unique Games To Boolean Unique Games

06/23/2020
by   Ronen Eldan, et al.
Weizmann Institute of Science
The University of Texas at Austin
0

We reduce the problem of proving a "Boolean Unique Games Conjecture" (with gap 1-delta vs. 1-C*delta, for any C> 1, and sufficiently small delta>0) to the problem of proving a PCP Theorem for a certain non-unique game. In a previous work, Khot and Moshkovitz suggested an inefficient candidate reduction (i.e., without a proof of soundness). The current work is the first to provide an efficient reduction along with a proof of soundness. The non-unique game we reduce from is similar to non-unique games for which PCP theorems are known. Our proof relies on a new concentration theorem for functions in Gaussian space that are restricted to a random hyperplane. We bound the typical Euclidean distance between the low degree part of the restriction of the function to the hyperplane and the restriction to the hyperplane of the low degree part of the function.

READ FULL TEXT

page 1

page 2

page 3

page 4

03/15/2021

Strong Parallel Repetition for Unique Games on Small Set Expanders

Strong Parallel Repetition for Unique Games on Small Set Expanders The...
01/25/2019

A structure theorem for almost low-degree functions on the slice

The Fourier-Walsh expansion of a Boolean function f {0,1}^n →{0,1} is it...
11/26/2017

Low degree almost Boolean functions are sparse juntas

Nisan and Szegedy showed that low degree Boolean functions are juntas. K...
11/12/2018

Streaming Hardness of Unique Games

We study the problem of approximating the value of a Unique Game instanc...
11/04/2019

Statistical physics approaches to Unique Games

We show how two techniques from statistical physics can be adapted to so...
08/27/2018

Unique Solutions of Contractions, CCS, and their HOL Formalisation

The unique solution of contractions is a proof technique for bisimilarit...
11/11/2020

Three Candidate Plurality is Stablest for Small Correlations

Using the calculus of variations, we prove the following structure theor...