Consideration is given to a situation in which two processors, P/sub 1/ and P/sub 2/, are to evaluate a collection of functions f/sub 1/, . . . f/sub s/ of two vector variables x, y under the assumption that processor P/sub 1/ (respectively, P/sub 2/) has access only to the value of the variable x (respectively, y) and the functional form of f/sub 1/,. . ., f/sub s/. Bounds on the communication complexity (the amount of information that has to be exchanged between the processors) are provided. An almost optimal bound is derived for the case of one-way communication when the functions are polynomials. Lower bounds for the case of two-way communication that improve on earlier bounds are also derived. As an application, the case in which x and y are n*n matrices and f(x,y) is a particular entry of the inverse of x+y is considered. Under a certain restriction on the class of allowed communication protocols, an Omega (n/sup 2/) lower bound is obtained. The results are based on certain tools from classical algebraic geometry and field extension theory.<<ETX>>
[1]
John N. Tsitsiklis,et al.
On the Communication Complexity of Solving a Polynomial Equation
,
1989,
SIAM J. Comput..
[2]
Andrew Chi-Chih Yao,et al.
Some complexity questions related to distributive computing(Preliminary Report)
,
1979,
STOC.
[3]
Harold Abelson,et al.
Lower bounds on information transfer in distributed computations
,
1978,
19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[4]
Harold Abelson,et al.
Corrigendum: Towards a Theory of Local and Global in Computation
,
1978,
Theoretical Computer Science.