منابع مشابه
Communication Complexity
The disjointness problem is one of the most important questions in communication complexity, and lower bounds for disjointness have been used to derive lower bounds for streaming algorithms, data structures, barriers in complexity (algebraization), approaches for circuit lower bounds, proof complexity, game theory. Some sources on this include the survey “The Story of Set Disjointness” by Chatt...
متن کاملCommunication Complexity
The first section starts with the basic definitions following mainly the notations of the book written by E. Kushilevitz and N. Nisan [8]. This whole thesis started from this book and some parts follow the proofs from there but I always tried to simplify and improve them, I even discovered and corrected a false claim. But most of the results are mine, supervised by Zoltán Király. At the beginni...
متن کاملCommunication complexity
In this chapter we survey the theory of two-party communication complexity. This field of theoretical computer science aims at studying the following, seemingly very simple, scenario: There are two players Alice who holds an n-bit string x and Bob who holds an n-bit string y. Their goal is to communicate in order to compute the value of some boolean function f(x, y), while exchanging a number o...
متن کاملCommunication Complexity
When I was asked to write a contribution for this book about something related to my research, I immediately thought of Communication Complexity. This relatively simple but extremely beautiful and important sub-area of Complexity Theory studies the amount of communication needed for several distributed parties to learn something new. We will review the basic communication model and some of the ...
متن کاملRandomized Communication Complexity of Approximating Kolmogorov Complexity
The paper [Harry Buhrman, Michal Koucký, Nikolay Vereshchagin. Randomized Individual Communication Complexity. IEEE Conference on Computational Complexity 2008: 321-331] considered communication complexity of the following problem. Alice has a binary string x and Bob a binary string y, both of length n, and they want to compute or approximate Kolmogorov complexity C(x|y) of x conditional to y. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1984
ISSN: 0022-0000
DOI: 10.1016/0022-0000(84)90069-2