This paper provides the first general technique for proving information lower bounds on two-party unbounded-rounds communication problems.
確定! 回上一頁