| Document Date: 2014-06-25 14:31:55
Open Document File Size: 862,84 KBShare Result on Facebook
City New York / / Company CNF / Common sense / ACM Inc. / Boolean / / Country United States / / Currency USD / / / Event FDA Phase / / Facility Penn Plaza / University of California / / / IndustryTerm classical protocols / randomized protocol / restricted multiparty protocols / simultaneous protocol / inner product / nondeterministic protocols / tensor product / nondeterministic protocol / communication protocol / combinatorial applications / analytic tools / communication protocols / proof systems / ordinary randomized protocol / matrix-analytic tools / / Organization National Science Foundation / University of California / Los Angeles / Computer Science Department / / Person Bob / Alice / ALEXANDER A. SHERSTOV / Zhu / Shi / / / Position Author / powerful model of bounded-error communication / General / general interest / model of multiparty communication / / Product Pentax K-x Digital Camera / X1 / Remark / / ProgrammingLanguage R / / ProvinceOrState California / New York / / PublishedMedium Journal of the ACM / Theory of Computing / / Technology quantum protocols / restricted multiparty protocols / nondeterministic protocol / simultaneous protocol / Merlin-Arthur protocols / Merlin-Arthur protocol / communication protocol / ordinary randomized protocol / dom / communication protocols / / URL http /
SocialTag |
A Communication Lower Bounds Using Directional Derivatives ALEXANDER A. SHERSTOV, University of California, Los Angeles We study the set disjointness problem in the most powerful model of bounded-error communication, the