AI Chat AI Image Generator AI Video Text to Speech

Nondeterministic Communication Complexity with Help and Graph Functions

10/25/2017

∙

by Adi Shraibman, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 09/13/2017

Lower Bounds for Approximating Graph Parameters via Communication Complexity

We present a new framework for proving query complexity lower bounds for...

0 Talya Eden, et al. ∙

research

∙ 11/09/2018

The layer complexity of Arthur-Merlin-like communication

In communication complexity the Arthur-Merlin (AM) model is the most nat...

0 D. Gavinsky, et al. ∙

research

∙ 02/25/2022

Bounds on Determinantal Complexity of Two Types of Generalized Permanents

We define two new families of polynomials that generalize permanents and...

0 Tristram Bogart, et al. ∙

research

∙ 03/06/2018

On Simple Back-Off in Complicated Radio Networks

In this paper, we study local and global broadcast in the dual graph mod...

0 Seth Gilbert, et al. ∙

research

∙ 07/03/2021

Average-Case Communication Complexity of Statistical Problems

We study statistical problems, such as planted clique, its variants, and...

0 Cyrus Rashtchian, et al. ∙

research

∙ 11/03/2017

A Rudimentary Model for Low-Latency Anonymous Communication Systems

In this paper we present a rudimentary model for low-latency anonymous c...

0 Yufan Zheng, et al. ∙

research

∙ 02/05/2019

The Hardest Halfspace

We study the approximation of halfspaces h:{0,1}^n→{0,1} in the infinity...

0 Alexander A. Sherstov, et al. ∙