Back to Results
First PageMeta Content
Computational complexity theory / PP / Communication complexity / Pseudorandom generator / Multiparty communication complexity / Vitali covering lemma / Theoretical computer science / Applied mathematics / Quantum complexity theory


Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness Anup Rao∗1 and Amir Yehudayoff†2 1 Department of Computer Science and Engineering
Add to Reading List

Document Date: 2015-04-07 12:10:30


Open Document

File Size: 566,91 KB

Share Result on Facebook

City

New York / /

Company

McGraw-Hill Book Co. / Cambridge University Press / SIAM Journal / Creative Commons / Dagstuhl Publishing / /

Country

Germany / /

/

Event

FDA Phase / /

Facility

Engineering University of Washington / University of Toronto / /

IndustryTerm

deterministic protocol / deterministic protocols / randomized communication protocol / chosen deterministic protocol / multi-party protocols / communication protocol / beautiful deterministic protocol / deterministic communication protocol / party protocol / communication protocols / computing / proof systems / /

Organization

Cambridge University / National Science Foundation / Israel Science Foundation / Binational Science Foundation / Taub Foundation / Department of Computer Science / University of Washington / Seattle / University of Toronto / Technion / /

Person

D. Sivakumar / Pavel Hrubeš / Amir Yehudayoff / Georg Schnitger / T. S. Jayram / Bala Kalyanasundaram / David Zuckerman / Eyal Kushilevitz / Arkadev Chattopadhyay / Tuomas Sandholm / László Babai / Ravi Kumar / Ziv Bar-Yossef / Anup Rao / Mario Szegedy / Vince Grolmusz / Mark Braverman / Richard J. Lipton / Alexander Sherstov / Ashok K. Chandra / Peter G. Kimmel / Merrick L. Furst / Ilya Segal / Avi Wigderson / Elliot W. Cheney / Thomas P. Hayes / Vincent Conitzer / Dang-Trinh Huynh-Ngoc / Shahar Dobzinski / Troy Lee / Noam Nisan / Adi Shraibman / Paul Beame / Yehudayoff I Theorem / R. K. Chung / Nathan Segerlind / Mikael Goldmann / Ankur Moitra / Prasad Tetali / Johan Håstad / Anil Ada / Toniann Pitassi / /

Position

Editor / Prime Minister / randomized communication Pm / /

Product

H1 / F1 / /

ProvinceOrState

New York / /

PublishedMedium

Mathematische Zeitschrift / SIAM Journal on Computing / Lecture Notes in Computer Science / /

Technology

beautiful deterministic protocol / randomized communication protocol / Multi-party protocols / deterministic protocol / party protocol / randomized protocol / Pmevery protocol / chosen deterministic protocol / deterministic communication protocol / communication protocol / communication protocols / Digital Object Identifier / /

SocialTag