Probabilistic Communication Complexity Over The Reals
نویسندگان
چکیده
منابع مشابه
Kolmogorov Complexity Theory over the Reals
Kolmogorov Complexity constitutes an integral part of computability theory, information theory, and computational complexity theory— in the discrete setting of bits and Turing machines. Over real numbers, on the other hand, the BSS-machine (aka real-RAM) has been established as a major model of computation. This real realm has turned out to exhibit natural counterparts to many notions and resul...
متن کاملThe Complexity of Temporal Logic over the Reals
It is shown that the decision problem for the temporal logic with until and since connectives over real-numbers time is PSPACE-complete.
متن کاملOn the Decisional Complexity of Problems Over the Reals
We consider the role of randomness for the decisional complexity in algebraic decision (or computation) trees, i.e. the number of comparisons ignoring all other computation. Recently Ting and Yao showed that the problem of finding the maximum of n elements has decisional complexity O(log2 n). In contrast, Rabin showed in 1972 an Ω(n) bound for the deterministic case. We point out that their tec...
متن کامل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...
متن کاملCounting Complexity Classes over the Reals I: The Additive Case
We define a counting class #Padd in the Blum-Shub-Smalesetting of additive computations over the reals. Structural properties of this class are studied, including a characterization in terms of the classical counting class #P introduced by Valiant. We also establish transfer theorems for both directions between the real additive and the discrete setting. Then we characterize in terms of complet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2008
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-008-0255-z