Displaying similar documents to “Communication complexity and lower bounds on multilective computations”

One-way communication complexity of symmetric Boolean functions

Jan Arpe, Andreas Jakoby, Maciej Liśkiewicz (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We study deterministic one-way communication complexity of functions with Hankel communication matrices. Some structural properties of such matrices are established and applied to the one-way two-party communication complexity of symmetric Boolean functions. It is shown that the number of required communication bits does not depend on the communication direction, provided that neither direction needs maximum complexity. Moreover, in order to obtain an optimal protocol, it is in...

Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication

Beate Bollig (2001)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Branching programs are a well established computation model for Boolean functions, especially read-once branching programs have been studied intensively. In this paper the expressive power of nondeterministic read-once branching programs, more precisely the class of functions representable in polynomial size, is investigated. For that reason two restricted models of nondeterministic read-once branching programs are defined and a lower bound method is presented. Furthermore, the first...