On independent sets, 2-to-2 games, and Grassmann graphs

Abstract

We present a candidate reduction from the 3-Lin problem to the 2-to-2 Games problem and present a combinatorial hypothesis about Grassmann graphs which, if correct, is sufficient to show the soundness of the reduction in a certain non-standard sense. A reduction that is sound in this non-standard sense implies that it is NP-hard to distinguish whether an <i… (More)
DOI: 10.1145/3055399.3055432

Topics

Cite this paper

@inproceedings{Khot2016OnIS, title={On independent sets, 2-to-2 games, and Grassmann graphs}, author={Subhash Khot and Dor Minzer and Shmuel Safra}, booktitle={STOC}, year={2016} }