ON THE DISTRIBUTIONAL COMPLEXITY OF DISJOINTNESS

被引：260
|
作者：
RAZBOROV, AA
机构：
[1] Steklov Mathematical Institute, Vavilova, 42, GSP-1, 117966, Moscow
来源：
THEORETICAL COMPUTER SCIENCE | 1992年 / 106卷 / 02期
关键词：
D O I：
10.1016/0304-3975(92)90260-M
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We prove that the distributional communication complexity of the predicate "disjointness" with respect to a very simple measure on inputs is OMEGA(n).
引用
收藏
页码：385 / 390
页数：6
相关论文
共 50 条
  • [1] ON THE DISTRIBUTIONAL COMPLEXITY OF DISJOINTNESS
    RAZBOROV, AA
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 443 : 249 - 253
  • [2] Measure complexity and Mobius disjointness
    Huang, Wen
    Wang, Zhiren
    Ye, Xiangdong
    ADVANCES IN MATHEMATICS, 2019, 347 : 827 - 858
  • [3] THE MULTIPARTY COMMUNICATION COMPLEXITY OF SET DISJOINTNESS
    Sherstov, Alexander A.
    SIAM JOURNAL ON COMPUTING, 2016, 45 (04) : 1450 - 1489
  • [4] The Randomized Communication Complexity of Set Disjointness
    Royal Institute of Technology, Stockholm, Sweden
    不详
    Theory Comput., 2007, (211-219):
  • [5] The Multiparty Communication Complexity of Set Disjointness
    Sherstov, Alexander A.
    STOC'12: PROCEEDINGS OF THE 2012 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2012, : 525 - 544
  • [6] Topological complexity, return times and weak disjointness
    Huang, W
    Ye, XD
    ERGODIC THEORY AND DYNAMICAL SYSTEMS, 2004, 24 : 825 - 846
  • [7] Quantum Distributed Complexity of Set Disjointness on a Line
    Magniez, Frederic
    Nayak, Ashwin
    ACM TRANSACTIONS ON COMPUTATION THEORY, 2022, 14 (01)
  • [8] Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness
    Rao, Anup
    Yehudayoff, Amir
    30TH CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2015), 2015, 33 : 88 - 101
  • [9] Beyond Set Disjointness: The Communication Complexity of Finding the Intersection
    Brody, Joshua
    Chakrabarti, Amit
    Kondapally, Ranganath
    Woodruff, David P.
    Yaroslavtsev, Grigory
    PROCEEDINGS OF THE 2014 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'14), 2014, : 106 - 113
  • [10] Communication Complexity of Set-Disjointness for All Probabilities
    Goeoes, Mika
    Watson, Thomas
    THEORY OF COMPUTING, 2016, 12
12345