A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
In this paper, we introduce and develop the field of algebraic communication complexity, the theory dealing with the least number of messages to be exchanged between two players in order to compute the value of a polynomial or rational function depending on an input distributed between the two players. We define a general algebraic model over an arbitrary field k of characteristic 0, where the involved functions can be computed with the natural operations additions, multiplications anddoi:10.1007/978-3-540-79309-0_19 fatcat:4jxzih7tebdn3palt6tjukbhjy