LOWER BOUNDS ON COMMUNICATION COMPLEXITY

被引：29
|
作者：
DURIS, P
GALIL, Z
SCHNITGER, G
机构：
[1] COLUMBIA UNIV,NEW YORK,NY 10027
[2] TEL AVIV UNIV,IL-69978 TEL AVIV,ISRAEL
[3] PENN STATE UNIV,UNIVERSITY PK,PA 16802
来源：
INFORMATION AND COMPUTATION | 1987年 / 73卷 / 01期
关键词：
D O I：
10.1016/0890-5401(87)90037-X
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：1 / 22
页数：22
相关论文
共 50 条
  • [1] Lower Bounds in Communication Complexity
    Lee, Troy
    Shraibman, Adi
    [J]. FOUNDATIONS AND TRENDS IN THEORETICAL COMPUTER SCIENCE, 2007, 3 (04): : 263 - 399
  • [2] Lower bounds for quantum communication complexity
    Klauck, H
    [J]. 42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, : 288 - 297
  • [3] Lower bounds on the multiparty communication complexity
    Duris, P
    Rolim, JDP
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1998, 56 (01) : 90 - 95
  • [4] Communication complexity lower bounds by polynomials
    Buhrman, H
    de Wolf, R
    [J]. 16TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2000, : 120 - 130
  • [5] Lower bounds for quantum communication complexity
    Klauck, Hartmut
    [J]. SIAM JOURNAL ON COMPUTING, 2007, 37 (01) : 20 - 46
  • [6] Communication complexity and lower bounds on multilective computations
    Hromkovic, J
    [J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1999, 33 (02): : 193 - 212
  • [7] Lower bounds on quantum multiparty communication complexity
    Lee, Troy
    Schechtman, Gideon
    Shraibman, Adi
    [J]. PROCEEDINGS OF THE 24TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, 2009, : 254 - +
  • [8] Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness
    Rao, Anup
    Yehudayoff, Amir
    [J]. 30TH CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2015), 2015, 33 : 88 - 101
  • [9] Lower Bounds in Communication Complexity Based on Factorization Norms
    Linial, Nati
    Shraibman, Adi
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2009, 34 (03) : 368 - 394
  • [10] Lower Bounds in Communication Complexity Based on Factorization Norms
    Linial, Nati
    Shraibman, Adi
    [J]. STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 699 - 708
12345