Lower Bounds for Clique vs. Independent Set

@article{Gs2015LowerBF,
  title={Lower Bounds for Clique vs. Independent Set},
  author={Mika G{\"o}{\"o}s},
  journal={2015 IEEE 56th Annual Symposium on Foundations of Computer Science},
  year={2015},
  pages={1066-1076}
}
We prove an ω(log n) lower bound on the Conon deterministic communication complexity of the Clique vs. Independent Set problem introduced by Yannakakis (STOC 1988, JCSS 1991). As a corollary, this implies super polynomial lower bounds for the Alon - Saks - Seymour conjecture in graph theory. Our approach is to first exhibit a query complexity separation for the decision tree analogue of the UP vs. coNP question - namely, unambiguous DNF width vs. CNF width - and then "lift" this separation over… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS
24 Citations
19 References
Similar Papers

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…