scientific article; zbMATH DE number 88975

zbMATH Open0755.68080MaRDI QIDQ4016535FDOQ4016535

Authors: Zhi-Quan Luo 

Publication date: 16 January 1993

Title of this publication is not available (Why is that?)

Recommendations

• One-way communication complexity of computing a collection of rational functions
• Communication complexity of some number theoretic functions
• scientific article; zbMATH DE number 1421021
• On communication complexity of vector-valued functions
• On rational computability and communication complexity
• Communication complexity of permutation-invariant functions
• Communication Complexity and Lower Bounds on Multilective Computations
• On the Communication Complexity of AND Functions
• The communication complexity for decentralized evaluation of functions
• Communication complexity and orthogonal polynomials

zbMATH Keywords

optimal lower boundoptimal upper boundparallel and distributed computationone-way communication

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cited In (7)

• Communication complexity of convex optimization
• Information Transfer under Different Sets of Protocols
• On the communication complexity of distributed algebraic computation
• Communication complexity of matrix computation over finite fields
• The communication complexity of computing differentiable functions in a multicomputer network
• Functional inversion and communication complexity
• The communication complexity for decentralized evaluation of functions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016535)