On Independent Sets, 2-to-2 Games and Grassmann Graphs

@article{Khot2016OnIS,
  title={On Independent Sets, 2-to-2 Games and Grassmann Graphs},
  author={Subhash Khot and Dor Minzer and Shmuel Safra},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2016},
  volume={23},
  pages={124}
}
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>n</i>-vertex graph has an independent set of size ( 1− 1/√2 ) <i>n</i> − <i>o</i>(<i>n</i>) or whether every independent set has size… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS

Topics

Statistics

01020201620172018
Citations per Year

Citation Velocity: 9

Averaging 9 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.