Lower Bounds for Clique vs. Independent Set

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 to communication complexity using a result from prior work.

[1]  H. Buhrman,et al.  Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..

[2]  Nicolas Bousquet,et al.  Clique versus independent set , 2013, Eur. J. Comb..

[3]  Noam Nisan,et al.  On the degree of boolean functions as real polynomials , 1992, STOC '92.

[4]  Stasys Jukna,et al.  Boolean Function Complexity Advances and Frontiers , 2012, Bull. EATCS.

[5]  S. Vadhan.  Pseudorandomness II , 2009 .

[6]  Alexander A. Razborov,et al.  On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..

[7]  Petr Savický.  On determinism versus unambiquous nondeterminism for decision trees , 2002, Electron. Colloquium Comput. Complex..

[8]  Volker Kaibel,et al.  A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially , 2013, Discret. Comput. Geom..

[9]  Reinhard Diestel,et al.  Graph Theory, 4th Edition , 2012, Graduate texts in mathematics.

[10]  Kazuyuki Amano,et al.  Ordered biclique partitions and communication complexity problems , 2013, Discret. Appl. Math..

[11]  Hao Huang,et al.  A counterexample to the Alon-Saks-Seymour conjecture and related problems , 2010, Comb..

[12]  M. Yannakakis.  Expressing combinatorial optimization problems by linear programs , 1991, Symposium on the Theory of Computing.

[13]  Noam Nisan,et al.  On rank vs. communication complexity , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[14]  E. Kushilevitz,et al.  Communication Complexity: Basics , 1996 .

[15]  Eyal Kushilevitz,et al.  On the complexity of communication complexity , 2009, STOC '09.

[16]  Eyal Kushilevitz,et al.  The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[17]  Shachar Lovett,et al.  Rectangles Are Nonnegative Juntas , 2015, SIAM J. Comput..

[18]  Kazuyuki Amano,et al.  Some improved bounds on communication complexity via new decomposition of cliques , 2014, Discret. Appl. Math..

[19]  Oded Goldreich,et al.  Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..

[20]  Rafail Ostrovsky,et al.  The Linear-Array Conjecture in Communication Complexity Is False , 1996, STOC '96.