Communication complexity of algebraic computation

The authors consider a situation in which two processors P/sub 1/ and P/sub 2/ are to evaluate one or more functions f/sub 1/, . . ., f/sub s/ of two vector variables x and y, under the assumption that processor P/sub 1/ (respectively, P/sub 2/) has access only to the value of x (respectively, y) and the functional form of f/sub 1/, . . ., f/sub s/. They consider a continuous model of communication whereby real-valued messages are transmitted, and they study the minimum number of messages required for the desired computation. Tight lower bounds are established for the following three problems: (1) each f/sub i/ is a rational function and only one-way communication is allowed. (2) The variables x and y are matrices and the processors wish to solve the linear system (x+y)z=b for the unknown z. (3) The processors wish to evaluate a particular root of the polynomial equation Sigma (x/sub i/+y/sub i/)z/sup i/=0, where the sum is from i=0 to n-1.<<ETX>>

[1]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[2]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[3]  Alfred V. Aho,et al.  On notions of information transfer in VLSI circuits , 1983, STOC.

[4]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

[5]  Wolfgang Maass,et al.  On the communication complexity of graph properties , 1988, STOC '88.

[6]  Christos H. Papadimitriou,et al.  Communication complexity , 1982, STOC '82.

[7]  Viktor K. Prasanna,et al.  Information Transfer in Distributed Computing with Applications to VLSI , 1984, JACM.

[8]  J. Ortega.  Introduction to Parallel and Vector Solution of Linear Systems , 1988, Frontiers of Computer Science.

[9]  Kurt Mehlhorn,et al.  Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.

[10]  S. Smale.  On the efficiency of algorithms of analysis , 1985 .

[11]  Michael Francis Atiyah,et al.  Introduction to commutative algebra , 1969 .

[12]  Allan Borodin,et al.  The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.

[13]  Harold Abelson,et al.  Lower bounds on information transfer in distributed computations , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[14]  Harold Abelson,et al.  Corrigendum: Towards a Theory of Local and Global in Computation , 1978, Theoretical Computer Science.

[15]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.