메뉴 건너뛰기




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;

EID: 0034858470     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (30)

References (12)


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.