One-way communication complexity of computing a collection of rational functions

DOI10.1006/JCOM.1994.1008MaRDI QIDQ1333237zbMATH OpenOpenAlexFDO

Authors Zhi-Quan Luo

Publication date 19 September 1995

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcom.1994.1008

zbMATH Keywords

communication complexitydistributed computation

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Distributed algorithms (68W15) Algebraic field extensions (12F05)

Recommendations

• scientific article; zbMATH DE number 88975
• On the communication complexity of distributed algebraic computation
• On the Communication Complexity of Solving a Polynomial Equation

Cited in

(3)

• scientific article; zbMATH DE number 88975 (Why is no real title available?)
• On the communication complexity of distributed algebraic computation
• Two-way communication complexity of sum-type functions for one processor to be informed

This page was built for publication: One-way communication complexity of computing a collection of rational functions

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