Nondeterministic Communication Complexity with Help and Graph Functions

TL;DR

This paper introduces a new nondeterministic communication complexity model with help, and uses it to establish logarithmic lower bounds on the communication complexity of explicit graph functions in the number-on-forehead model.

Contribution

It defines a novel nondeterministic communication complexity model with help and applies it to prove new lower bounds for explicit graph functions.

Findings

Established logarithmic lower bounds for NOF communication complexity of graph functions

Introduced a nondeterministic communication complexity model with help

Provided bounds complementary to previous results by Beame et al.

Abstract

We define nondeterministic communication complexity in the model of communication complexity with help of Babai, Hayes and Kimmel. We use it to prove logarithmic lower bounds on the NOF communication complexity of explicit graph functions, which are complementary to the bounds proved by Beame, David, Pitassi and Woelfel.