Abstract: In this talk, we will go through some of the results in the paper "Communication with Imperfectly Shared Randomness <http://arxiv.org/abs/1411.3603
Abstract: In two-party secure computation, Alice has an input X, Bob has an input Y and both of them want to compute a function $f:\mathcal{X} \times \mathcal{Y} \to \mathcal{Z}$ securely by exchanging messages to each other over several rounds.
Abstract: A set S is said to be 3-term A.P free if there are no elements in S which form a 3-term A.P.In first part of talk, we will see a greedy way of constructing a 3-term A.P free set S.In the later part, we state and prove Behrend's theorem w
