The goal of this course is to get acquainted with some basic tools
of communication complexity.
The focus is the two-party model introduced by {\em Yao} in 1979.
In the setting there are two players {\em Alice} and {\em Bob}.
Each of them holds some data which are unknown to the other.
Suppose they want to compute a function on the data found in both of them.
Communication complexity deals with the fundamental question:
How many times do Alice and Bob have to communicate with each other
in order to compute the function?