Abstract
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 that has 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-sidederror 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-to-communication 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Josh Alman & Ryan Williams (2017). Probabilistic Rank and Matrix Rigidity. In Proceedings of the 49th Symposium on Theory of Computing (STOC), 641–652. ACM
László Babai, Peter Frankl & Janos Simon (1986). Complexity Classes in Communication Complexity Theory. In Proceedings of the 27th Symposium on Foundations of Computer Science (FOCS), 337–347. IEEE
László Babai, Noam Nisan & Mario Szegedy (1989). Multiparty Protocols and Logspace-Hard Pseudorandom Sequences. In Proceedings of the 21st Symposium on Theory of Computing (STOC), 1–11. ACM
Ziv Bar-Yossef, T.S., Jayram, Ravi Kumar, Sivakumar, D.: An Information Statistics Approach to Data Stream and Communication Complexity. Journal of Computer and System Sciences 68(4), 702–732 (2004)
Beigel, Richard: Bounded Queries to SAT and the Boolean Hierarchy. Theoretical Computer Science 84(2), 199–223 (1991)
Alberto Bertoni, Danilo Bruschi, Deborah Joseph, Meera Sitharam & Paul Young (1989). Generalized Boolean Hierarchies and Boolean Hierarchies over RP. In Proceedings of the 7th International Conference on Fundamentals of Computation Theory (FCT), 35–46. Springer
Jin-Yi Cai & Lane Hemachandra (1986). The Boolean Hierarchy: Hardware over NP. In Proceedings of the 1st Structure in Complexity Theory Conference (STRUCTURES), 105–124. Springer
Arkadev Chattopadhyay, Shachar Lovett & Marc Vinyals (2019). Equality Alone Does Not Simulate Randomness. In Proceedings of the 34th Computational Complexity Conference (CCC), 14:1–14:11. Schloss Dagstuhl
Mika Göös (2015). Lower Bounds for Clique vs. Independent Set. In Proceedings of the 56th Symposium on Foundations of Computer Science (FOCS), 1066–1076. IEEE
Göös, Mika, Kamath, Pritish, Pitassi, Toniann, Watson, Thomas: Query-to-Communication Lifting for \(\rm P\mathit{^{\footnotesize \rm NP}}\). Computational Complexity 28(1), 113–144 (2019)
Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson & David Zuckerman (2016a). Rectangles Are Nonnegative Juntas. SIAM Journal on Computing 45(5), 1835–1869
Mika Göös, Toniann Pitassi & Thomas Watson (2016b). Zero-Information Protocols and Unambiguity in Arthur–Merlin Communication. Algorithmica 76(3), 684–719
Mika Göös, Toniann Pitassi & Thomas Watson (2018a). Deterministic Communication vs. Partition Number. SIAM Journal on Computing 47(6), 2435–2450
Mika Göös, Toniann Pitassi & Thomas Watson (2018b). The Landscape of Communication Complexity Classes. Computational Complexity 27(2), 245–304
Mika Göös, Toniann Pitassi & Thomas Watson (2020). Query-to-Communication Lifting for BPP. SIAM Journal on Computing 49(4), FOCS17–441–FOCS17–461
Bernd Halstenberg & Rüdiger Reischuk (1988). Relations Between Communication Complexity Classes. In Proceedings of the 3rd Structure in Complexity Theory Conference (STRUCTURES), 19–28. IEEE
Bernd Halstenberg & Rüdiger Reischuk: Relations Between Communication Complexity Classes. Journal of Computer and System Sciences 41(3), 402–429 (1990)
Bernd Halstenberg & Rüdiger Reischuk: Different Modes of Communication. SIAM Journal on Computing 22(5), 913–934 (1993)
Stasys Jukna (2012). Boolean Function Complexity: Advances and Frontiers, volume 27 of Algorithms and Combinatorics. Springer
Kadin, Jim: The Polynomial Time Hierarchy Collapses if the Boolean HierarchyCollapses. SIAM Journal on Computing 17(6), 1263–1282 (1988)
Bala Kalyanasundaram & Georg Schnitger: The Probabilistic Communication Complexity of Set Intersection. SIAM Journal on Discrete Mathematics 5(4), 545–557 (1992)
Hartmut Klauck (2003). Rectangle Size Bounds and Threshold Covers in Communication Complexity. In Proceedings of the 18th Conference on Computational Complexity (CCC), 118–134. IEEE
Köbler, Johannes, Schöning, Uwe, Wagner, Klaus: The Difference and Truth-Table Hierarchies for NP. Theoretical Informatics and Applications 21(4), 419–435 (1987)
Eyal Kushilevitz & Noam Nisan: Communication Complexity. Cambridge University Press (1997)
Nati Linial, Toniann Pitassi & Adi Shraibman (2019). On the Communication Complexity of High-Dimensional Permutations. In Proceedings of the 10th Innovations in Theoretical ComputerScience Conference (ITCS), 54:1–54:20. Schloss Dagstuhl
Nisan, Noam: CREW PRAMs and Decision Trees. SIAM Journal on Computing 20(6), 999–1007 (1991)
Periklis Papakonstantinou, Dominik Scheder & Hao Song (2014). Overlays and Limited Memory Communication. In Proceedings of the 29th Conference on Computational Complexity (CCC), 298–308. IEEE
Toniann Pitassi, Morgan Shirley & Thomas Watson (2020). Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. In Proceedings of the 47th International Colloquium on Automata, Languages, and Programming (ICALP), 92:1–92:19. Schloss Dagstuhl
Ran Raz & Pierre McKenzie: Separation of the Monotone NC Hierarchy. Combinatorica 19(3), 403–435 (1999)
Razborov, Alexander: On Rigid Matrices. Technical report, Steklov Mathematical Institute (1989). In Russian
Razborov, Alexander: On the Distributional Complexity of Disjointness. Theoretical Computer Science 106(2), 385–390 (1992)
Rivest, Ronald: Learning Decision Lists. Machine Learning 2(3), 229–246 (1987)
Klaus Wagner (1988). Bounded Query Computations. In Proceedings of the 3rd Structure in Complexity Theory Conference (STRUCTURES), 260–277. IEEE
Thomas Watson (2020). A \(\rm ZPP\it ^{\footnotesize \rm NP[1]\it }\) Lifting Theorem. ACM Transactions on Computation Theory 12(4), 27:1–27:20
Gerd Wechsung (1985). On the Boolean Closure of NP. In Proceedings of the 5th International Conference onFundamentals of Computation Theory (FCT), 485–493. Springer
Andrew Yao (1979). Some Complexity Questions Related to Distributive Computing. In Proceedings of the 11th Symposium on Theory of Computing (STOC), 209–213. ACM
Stathis Zachos & Hans Heller: A Decisive Characterization of BPP. Information and Control 69(1–3), 125–135 (1986)
Acknowledgements
A previous version of this article appeared at ICALP 2020 (Pitassi et al. 2020). Toniann Pitassi was supported by NSERC, NSF Grant No. CCF-1900460 and the IAS School of Mathematics. Morgan Shirley was supported by NSERC. Thomas Watson was supported by NSF grants CCF-1657377 and CCF-1942742. We thank Benjamin Rossman for helpful comments and discussions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Pitassi, T., Shirley, M. & Watson, T. Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. comput. complex. 30, 10 (2021). https://doi.org/10.1007/s00037-021-00210-5
Received:
Published:
DOI: https://doi.org/10.1007/s00037-021-00210-5