On the communication complexity of solving a polynominal equation
Cover title.
Övriga upphovsmän: | Luo, Zhi-Quan. |
---|---|
Språk: | eng |
Publicerad: |
Laboratory for Information and Decision Systems, Massachusetts Institute of Technology]
2003
|
Ämnen: | |
Länkar: | http://hdl.handle.net/1721.1/3133 |
Liknande verk
-
Communication complexity of convex optimization
Publicerad: (2003) -
On the communication complexity of distributed algebraic computation
Publicerad: (2003) -
On the average communication complexity of asynchronous distributed algorithms
Publicerad: (2003) -
Communication complexity of distributed shortest path algorithms
Publicerad: (2003) -
On the average communication complexity of asynchronous distributed algorithms
Publicerad: (2002)