메뉴 건너뛰기




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;

EID: 84880218412     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (57)

References (10)
  • 1
    • 0033077324 scopus 로고    scopus 로고
    • The space complexity of approximating the frequency moments
    • N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci., 58(1):137-147, 1999.
    • (1999) J. Comput. Syst. Sci. , vol.58 , Issue.1 , pp. 137-147
    • Alon, N.1    Matias, Y.2    Szegedy, M.3
  • 3
    • 3042569519 scopus 로고    scopus 로고
    • An information statistics approach to data stream and communication complexity
    • Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci., 68(4):702-732, 2004.
    • (2004) J. Comput. Syst. Sci. , vol.68 , Issue.4 , pp. 702-732
    • Bar-Yossef, Z.1    Jayram, T.S.2    Kumar, R.3    Sivakumar, D.4
  • 4
    • 0041513338 scopus 로고    scopus 로고
    • Near-optimal lower bounds on the multi-party communication complexity of set disjointness
    • A. Chakrabarti, S. Khot, and X. Sun. Near-optimal lower bounds on the multi-party communication complexity of set disjointness. In Proc. of 18th CCC, pages 107-117, 2003.
    • (2003) Proc. of 18th CCC , pp. 107-117
    • Chakrabarti, A.1    Khot, S.2    Sun, X.3
  • 5
    • 0035175812 scopus 로고    scopus 로고
    • Informational complexity and the direct sum problem for simultaneous message complexity
    • A. Chakrabarti, Y. Shi, A. Wirth, and A. C. Yao. Informational complexity and the direct sum problem for simultaneous message complexity. In Proc. of 42nd FOCS, pages 270-278, 2001.
    • (2001) Proc. of 42nd FOCS , pp. 270-278
    • Chakrabarti, A.1    Shi, Y.2    Wirth, A.3    Yao, A.C.4
  • 8
    • 84941465845 scopus 로고
    • A lower bound for discrimination information in terms of variation
    • S. Kullback. A lower bound for discrimination information in terms of variation. IEEE Trans. Inform. Theory, 4:126-127, 1967.
    • (1967) IEEE Trans. Inform. Theory , vol.4 , pp. 126-127
    • Kullback, S.1
  • 10
    • 85039623622 scopus 로고
    • Some complexity questions related to distributive computing (preliminary report)
    • A. C. Yao. Some complexity questions related to distributive computing (preliminary report). In Proc. of 11th STOC, pages 209-213, 1979.
    • (1979) Proc. of 11th STOC , pp. 209-213
    • Yao, A.C.1


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