Randomized Communication versus Partition Number

We show that randomized communication complexity can be superlogarithmic in the partition number of the associated communication matrix, and we obtain near-optimal randomized lower bounds for the Clique versus Independent Set problem. These results strengthen the deterministic lower bounds obtained in prior work (Göös, Pitassi, and Watson, FOCS’15). One of our main technical contributions states that information complexity when the cost is measured with respect to only 1-inputs (or only 0-inputs) is essentially equivalent to information complexity with respect to all inputs.

[1]  A. Razborov.  Communication Complexity , 2011 .

[2]  Nisheeth K. Vishnoi,et al.  A quadratically tight partition bound for classical communication complexity and query complexity , 2014, ArXiv.

[3]  Andris Ambainis,et al.  Separations in query complexity based on pointer functions , 2015, STOC.

[4]  Robin Kothari.  Nearly optimal separations between communication (or query) complexity and partitions , 2015, Computational Complexity Conference.

[5]  Hartmut Klauck,et al.  The Partition Bound for Classical Communication Complexity and Query Complexity , 2009, 2010 IEEE 25th Annual Conference on Computational Complexity.

[6]  Toniann Pitassi,et al.  Query-to-Communication Lifting for BPP , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[7]  Hartmut Klauck,et al.  Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity , 2010, Inf. Process. Lett..

[8]  Sepehr Assadi,et al.  Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem , 2017, PODS.

[9]  Shay Moran,et al.  Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound , 2014, ICALP.

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

[11]  Mark Braverman.  Interactive information complexity , 2012, STOC '12.

[12]  Prasad Raghavendra,et al.  On the Communication Complexity of Read-Once AC^0 Formulae , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[13]  Troy Lee,et al.  Separations in Communication Complexity Using Cheat Sheets and Information Complexity , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[14]  Mark Braverman,et al.  An information complexity approach to extended formulations , 2013, STOC '13.

[15]  Shachar Lovett,et al.  En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations , 2014, ICALP.

[16]  Gerard Tel,et al.  SOFSEM 2006: Theory and Practice of Computer Science, 32nd Conference on Current Trends in Theory and Practice of Computer Science, Merín, Czech Republic, January 21-27, 2006, Proceedings , 2006, SOFSEM.

[17]  Ronald de Wolf,et al.  Query Complexity in Expectation , 2014, ICALP.

[18]  Iordanis Kerenidis,et al.  Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications , 2012, SIAM J. Comput..

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

[20]  Toniann Pitassi,et al.  Randomized Communication vs. Partition Number , 2015, Electron. Colloquium Comput. Complex..

[21]  Michael E. Saks,et al.  Lattices, mobius functions and communications complexity , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[22]  Thomas Watson,et al.  Communication Complexity of Statistical Distance , 2018, Electron. Colloquium Comput. Complex..

[23]  Mihalis Yannakakis,et al.  Expressing combinatorial optimization problems by linear programs , 1991, STOC '88.

[24]  Mark Braverman,et al.  Information Equals Amortized Communication , 2011, IEEE Transactions on Information Theory.

[25]  Scott Aaronson,et al.  Separations in query complexity using cheat sheets , 2015, Electron. Colloquium Comput. Complex..

[26]  Miklos Santha,et al.  Separating decision tree complexity from subcube partition complexity , 2015, APPROX-RANDOM.

[27]  Mika Göös,et al.  Lower Bounds for Clique vs. Independent Set , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[28]  Mark Braverman,et al.  An Interactive Information Odometer and Applications , 2015, STOC.

[29]  Alfred V. Aho,et al.  On notions of information transfer in VLSI circuits , 1983, STOC.

[30]  Aleksandrs Belovs,et al.  Non-intersecting Complexity , 2006, SOFSEM.

[31]  Hans Raj Tiwary,et al.  Exponential Lower Bounds for Polytopes in Combinatorial Optimization , 2011, J. ACM.

[32]  Swagato Sanyal,et al.  Towards Better Separation between Deterministic and Randomized Query Complexity , 2015, FSTTCS.

[33]  Christian Glaßer,et al.  Error-bounded probabilistic computations between MA and AM , 2003, J. Comput. Syst. Sci..

[34]  Ziv Bar-Yossef,et al.  An information statistics approach to data stream and communication complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

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

[36]  Michael E. Saks,et al.  Lower Bounds on the Randomized Communication Complexity of Read-Once Functions , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[37]  Toniann Pitassi,et al.  Deterministic Communication vs. Partition Number , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[38]  Eyal Kushilevitz,et al.  Communication Complexity: Index of Notation , 1996 .