Non-deterministic communication complexity with few witnesses
نویسندگان
چکیده
منابع مشابه
Non-Deterministic Communication Complexity with Few Witnesses
We study non-deterministic communication protocols in which no input has too many witnesses. De ne nk(f) to be the minimum complexity of a non-deterministic protocol for the function f in which each input has at most k witnesses. We present two di erent lower bounds for nk(f). Our rst result shows that nk(f) is bounded below by (qc(f)=k) where c(f) is the deterministic complexity. Our second re...
متن کاملNon-Deterministic Communication Complexity of Regular Languages
The notion of communication complexity was introduced by Yao in his seminal paper [Yao79]. In [BFS86], Babai Frankl and Simon developed a rich structure of communication complexity classes to understand the relationships between various models of communication complexity. This made it apparent that communication complexity was a self-contained mini-world within complexity theory. In this thesis...
متن کاملCharacterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal exponents in these relations are unknown. We show that the non-deterministic quantum query complexity of f is linearly related to the degree of a “non-deterministic” polynomial for f . We also prove a quantum-classical...
متن کاملOn the Non-deterministic Communication Complexity of Regular Languages
In this paper we study the non-deterministic communication complexity of regular languages. We show that a regular language has either constant or at least logarithmic non-deterministic communication complexity. We prove several linear lower bounds which we know cover a wide range of regular languages with linear complexity. Furthermore we find evidence that previous techniques (Tesson and Thér...
متن کاملSeparating Deterministic from Randomized Multiparty Communication Complexity
We solve some fundamental problems in the number-on-forehead (NOF) kplayer communication model. We show that there exists a function which has at most logarithmic communication complexity for randomized protocols with one-sided falsepositives error probability of 1/3, but which has linear communication complexity for deterministic protocols and, in fact, even for the more powerful nondeterminis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1994
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(05)80049-2