|
Volumn 3, Issue , 2009, Pages 505-516
|
Asymptotically optimal lower bounds on the nih-multi-party information complexity of the and-function and disjointness
|
Author keywords
Communication complexity; Computational complexity
|
Indexed keywords
ASYMPTOTICALLY OPTIMAL;
COMMUNICATION COMPLEXITY;
DISJOINTNESS;
DISJOINTNESS PROBLEMS;
HAND MODEL;
INFORMATION COMPLEXITY;
LOWER BOUNDS;
COMPUTATIONAL COMPLEXITY;
COMPUTER SCIENCE;
|
EID: 84880218412
PISSN: 18688969
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (57)
|
References (10)
|