Probabilistic communication complexity
نویسندگان
چکیده
منابع مشابه
Probabilistic Communication Complexity
Communication is a bottleneck in many distributed computations. In VLSI, communication constraints dictate lower bounds on the performance of chips. The two-processor information transfer model measures the communication requirements to compute functions. We study the unbounded error probabilistic version of this model. Because of its weak notion of correct output, we believe that this model me...
متن کاملProbabilistic Communication Complexity of Boolean Relations
In [KW] it was proved that for every boolean function $f$ there exist a communication complexity game $R_f$ such that the minimal circuit-depth of $f$ exactly equals to the communication complexity of $R_f$. If $f$ is monotone then there also exists a game $R_f^m$ with communication complexity exactly equals to the monotone depth of $f$. It was also proved in [KW] that the communication complex...
متن کاملLower Bounds for One-way Probabilistic Communication Complexity
We prove three diierent types of complexity lower bounds for the one-way unbounded-error and bounded-error error probabilistic communication protocols for boolean functions. The lower bounds are proved in terms of the deterministic communication complexity of functions and in terms of the notion \probabilistic communication characteristic" that we deene. We present boolean functions with the di...
متن کاملCommunication complexity of channels in general probabilistic theories.
The communication complexity of a quantum channel is the minimal amount of classical communication required for classically simulating the process of preparation, transmission through the channel, and subsequent measurement of a quantum state. At present, only little is known about this quantity. In this Letter, we present a procedure for systematically evaluating the communication complexity o...
متن کاملLower Bounds for Probabilistic Space Complexity: Communication-Automata Approach
Multiplicative Linear Logic for Resource Transformation Nets p. 81 The Parameterized Complexity of Some Problems in Logic and Linguistics p. 89 Foundations of Proof Search Strategies Design in Linear Logic p. 101 On Extreme Points of Convex Compact Turing Located Set p. 114 Application of Typed Lambda Calculi in the Untyped Lambda Calculus p. 129 Classes with Pairwise Equivalent Enumerations p....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1986
ISSN: 0022-0000
DOI: 10.1016/0022-0000(86)90046-2