Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity

We investigate the power of randomness in two-party communication complexity. In particular, we study the model where the parties can make a constant number of queries to a function with an efficient one-sided-error randomized protocol. The complexity classes defined by this model comprise the Randomized Boolean Hierarchy, which is analogous to the Boolean Hierarchy but defined with one-sided-error randomness instead of nondeterminism. Our techniques connect the Nondeterministic and Randomized Boolean Hierarchies, and we provide a complete picture of the relationships among complexity classes within and across these two hierarchies. In particular, we prove that the Randomized Boolean Hierarchy does not collapse, and we prove a query-tocommunication lifting theorem for all levels of the Nondeterministic Boolean Hierarchy and use it to resolve an open problem stated in the paper by Halstenberg and Reischuk (CCC 1988) which initiated the study of this hierarchy. 2012 ACM Subject Classification Theory of computation → Communication complexity

[1]  Richard Ryan Williams,et al.  Probabilistic rank and matrix rigidity , 2016, STOC.

[2]  Rüdiger Reischuk,et al.  On different modes of communication , 1988, STOC '88.

[3]  Klaus W. Wagner,et al.  Bounded query computations , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[4]  Thomas Watson.  A ZPP^NP[1] Lifting Theorem , 2017, Electron. Colloquium Comput. Complex..

[5]  Shachar Lovett,et al.  Equality alone does not simulate randomness , 2018, Electron. Colloquium Comput. Complex..

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

[7]  Periklis A. Papakonstantinou,et al.  Overlays and Limited Memory Communication , 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).

[8]  Toniann Pitassi,et al.  Query-to-Communication Lifting for P^NP , 2017, Electron. Colloquium Comput. Complex..

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

[10]  Toniann Pitassi,et al.  The Landscape of Communication Complexity Classes , 2018, computational complexity.

[11]  HierarchyRan Raz,et al.  Separation of the Monotone NC , 1999 .

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

[13]  Noam Nisan,et al.  CREW PRAMS and decision trees , 1989, STOC '89.

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

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

[16]  Jim Kadin.  The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses , 1988, SIAM J. Comput..

[17]  Rüdiger Reischuk,et al.  Relations between Communication Complexity Classes , 1990, J. Comput. Syst. Sci..

[18]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[19]  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..

[20]  Hartmut Klauck,et al.  Rectangle size bounds and threshold covers in communication complexity , 2002, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

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

[22]  Alberto Bertoni,et al.  Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract) , 1989, FCT.

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

[24]  Stathis Zachos,et al.  A Decisive Characterization of BPP , 1986, Inf. Control..

[25]  Toniann Pitassi,et al.  Zero-Information Protocols and Unambiguity in Arthur–Merlin Communication , 2015, Algorithmica.

[26]  R. Beigel,et al.  Bounded Queries to SAT and the Boolean Hierarchy , 1991, Theor. Comput. Sci..

[27]  Noam Nisan,et al.  Multiparty protocols and logspace-hard pseudorandom sequences , 1989, STOC '89.

[28]  Peter Frankl,et al.  Complexity classes in communication complexity theory , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[29]  Jin-Yi Cai,et al.  The Boolean Hierarchy: Hardware over NP , 1986, SCT.

[30]  Ran Raz,et al.  Separation of the Monotone NC Hierarchy , 1999, Comb..

[31]  Ronald L. Rivest,et al.  Learning decision lists , 2004, Machine Learning.

[32]  Klaus W. Wagner,et al.  The Difference and Truth-Table Hierarchies for NP , 1987, RAIRO Theor. Informatics Appl..

[33]  Bala Kalyanasundaram,et al.  The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..

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

[35]  Thomas Watson,et al.  A ZPPNP[1] Lifting Theorem , 2020, Electron. Colloquium Comput. Complex..

[36]  Gerd Wechsung,et al.  On the Boolean closure of NP , 1985, FCT.