On the communication complexity of distributed algebraic computation

DOI10.1145/174147.174149zbMath0799.68121OpenAlexW2085716634MaRDI QIDQ4285628

Zhi-Quan Luo, John N. Tsitsiklis

Publication date: 24 March 1994

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/3117

zbMATH Keywords

lower boundscommunication complexityfield extensionalgebraic computationclassical algebraic geometry

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Distributed algorithms (68W15)

Related Items

Optimal One-Pass Nonparametric Estimation Under Memory Constraint, Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity