TY - JOUR
T1 - One-way communication complexity of computing a collection of rational functions
AU - Luo, Zhi Quan
PY - 1994/6
Y1 - 1994/6
N2 - We consider the problem of evaluating a collection of rational functions f(hook)1(x, y), f(hook)2(x, y), ⋯, f(hook)s(x, y) (x ∈ Rm, y ∈ Rn) using two processors P1 and P2, assuming that processor P1 (respectively P2) has access to input x (respectively y) and the functional form of f(hook). We establish, by way of algebraic field extension theory, an almost optimal lower bound on the one-way communication complexity (i.e. the minimum number of real-valued messages that have to be exchanged). Our result strengthens the early result of Abelson in several directions.
AB - We consider the problem of evaluating a collection of rational functions f(hook)1(x, y), f(hook)2(x, y), ⋯, f(hook)s(x, y) (x ∈ Rm, y ∈ Rn) using two processors P1 and P2, assuming that processor P1 (respectively P2) has access to input x (respectively y) and the functional form of f(hook). We establish, by way of algebraic field extension theory, an almost optimal lower bound on the one-way communication complexity (i.e. the minimum number of real-valued messages that have to be exchanged). Our result strengthens the early result of Abelson in several directions.
UR - http://www.scopus.com/inward/record.url?scp=43949161420&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=43949161420&partnerID=8YFLogxK
U2 - 10.1006/jcom.1994.1008
DO - 10.1006/jcom.1994.1008
M3 - Article
AN - SCOPUS:43949161420
SN - 0885-064X
VL - 10
SP - 179
EP - 198
JO - Journal of Complexity
JF - Journal of Complexity
IS - 2
ER -