On the Communication Complexity of Solving a Polynomial Equation

DOI10.1137/0220057MaRDI QIDQ3359763zbMATH OpenOpenAlexFDO

Authors Zhi-Quan Luo, John N. Tsitsiklis

Publication date 1991

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0220057

zbMATH Keywords

communication complexitylower boundpolynomial equation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the communication complexity of distributed algebraic computation
• scientific article; zbMATH DE number 1011685
• One-way communication complexity of computing a collection of rational functions
• On the parallel arithmetic complexity of the root-finding problem
• Algebraic complexity of computing polynomial zeros

Cited in

(7)

• Message length effects for solving polynomial systems on a hypercube
• The communication complexity of computing differentiable functions in a multicomputer network
• One-way communication complexity of computing a collection of rational functions
• On the communication complexity of Lipschitzian optimization for the coordinated model of computation
• Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols
• On the communication complexity of distributed algebraic computation
• scientific article; zbMATH DE number 1760022 (Why is no real title available?)

This page was built for publication: On the Communication Complexity of Solving a Polynomial Equation

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