The communication complexity of computing differentiable functions in a multicomputer network

DOI10.1016/0304-3975(94)90260-7zbMath0795.68106OpenAlexW2048409767MaRDI QIDQ1318701

Pengyuan Chen

Publication date: 5 April 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90260-7

zbMATH Keywords

communication complexitydistributed computationcomputing of differentiable functionsintercomputer communicationmulticomputer network

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Computation of special functions and constants, construction of tables (65D20)

Related Items (1)

Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity

Cites Work

• Unnamed Item
• Unnamed Item
• A lower bound for the dimension of the message space of the decentralized mechanisms realizing a given goal
• On the Communication Complexity of Solving a Polynomial Equation
• Lower Bounds on Information Transfer in Distributed Computations
• Some Complexity Results for Matrix Computations on Parallel Processors

This page was built for publication: The communication complexity of computing differentiable functions in a multicomputer network