|
Volumn , Issue , 2001, Pages 100-106
|
A linear lower bound on the unbounded error probabilistic communication complexity
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ERROR ANALYSIS;
LEARNING ALGORITHMS;
MATRIX ALGEBRA;
NETWORK PROTOCOLS;
PROBABILITY DENSITY FUNCTION;
PROBABILITY DISTRIBUTIONS;
HADAMARD MATRICES;
PROBABILISTIC ALGORITHM;
PROBABILISTIC COMMUNICATION PROTOCOL;
COMPUTATIONAL COMPLEXITY;
|
EID: 0034858470
PISSN: 10930159
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (30)
|
References (12)
|