On the Communication Complexity of Solving a Polynomial Equation

DOI10.1137/0220057zbMath0733.68042OpenAlexW2021562556MaRDI QIDQ3359763

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

lower boundcommunication complexitypolynomial equation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

On the communication complexity of Lipschitzian optimization for the coordinated model of computation ⋮ The communication complexity of computing differentiable functions in a multicomputer network

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