Comparison communication protocols

04/17/2022
by   Michael R. Klug, et al.
0

We introduce a restriction of the classical 2-party deterministic communication protocol where Alice and Bob are restricted to using only comparison functions. We show that the complexity of a function in the model is, up to a constant factor, determined by a complexity measure analogous to Yao's tiling number, which we call the geometric tiling number which can be computed in polynomial time. As a warm-up, we consider an analogous restricted decision tree model and observe a 1-dimensional analog of the above results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/05/2021

One-way communication complexity and non-adaptive decision trees

We study the relationship between various one-way communication complexi...
research
09/16/2022

Decision Tree Complexity versus Block Sensitivity and Degree

Relations between the decision tree complexity and various other complex...
research
05/03/2022

Scalable Private Decision Tree Evaluation with Sublinear Communication

Private decision tree evaluation (PDTE) allows a decision tree holder to...
research
07/04/2017

Supporting Ruled Polygons

We explore several problems related to ruled polygons. Given a ruling of...
research
03/01/2019

Sign-Rank Can Increase Under Intersection

The communication class UPP^cc is a communication analog of the Turing M...
research
12/24/2021

Efficient decision tree training with new data structure for secure multi-party computation

We propose a secure multi-party computation (MPC) protocol that construc...
research
04/01/2023

The communication complexity of functions with large outputs

We study the two-party communication complexity of functions with large ...

Please sign up or login with your details

Forgot password? Click here to reset