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

@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}
}
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

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 23 CITATIONS

Towards a proof of the 2-to-1 games conjecture?

VIEW 10 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Integer Programming and Combinatorial Optimization

VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion

  • 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2018
VIEW 10 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Small Set Expansion in The Johnson Graph

  • Electronic Colloquium on Computational Complexity
  • 2018
VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 12 REFERENCES

On the Power of Unique 2-Prover 1-Round Games

  • IEEE Conference on Computational Complexity
  • 2002
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Parallel Repetition in Projection Games and a Concentration Bound

  • SIAM J. Comput.
  • 2011
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

A Parallel Repetition Theorem

  • SIAM J. Comput.
  • 1998
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Some Optimal Inapproximability Results

VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…