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-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.
Leibniz International Proceedings in Informatics, LIPIcs
Pitassi, T., Shirley, M., & Watson, T. (2020). Nondeterministic and randomized Boolean Hierarchies in communication complexity. Leibniz International Proceedings in Informatics, LIPIcs, 168 https://doi.org/10.4230/LIPIcs.ICALP.2020.92