Direct Sum Fails for Zero-Error Average Communication

被引:1
|
作者
Kol, Gillat [1 ,2 ,3 ]
Moran, Shay [4 ,5 ]
Shpilka, Amir [6 ]
Yehudayoff, Amir [7 ]
机构
[1] Simons Inst Theory Comp, Berkeley, CA USA
[2] Technion, Haifa, Israel
[3] Inst Adv Study, Sch Math, Princeton, NJ 08540 USA
[4] Technion IIT, Dept Comp Sci, Haifa, Israel
[5] Max Planck Inst Informat, Saarbrucken, Germany
[6] Tel Aviv Univ, Dept Comp Sci, Tel Aviv, Israel
[7] Technion IIT, Dept Math, Haifa, Israel
基金
以色列科学基金会;
关键词
Communication complexity; Information complexity; External information; Amortized communication complexity; Promise problems; AMORTIZED COMMUNICATION; COMPLEXITY; THEOREM;
D O I
10.1007/s00453-016-0144-9
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We show that in the model of zero-error communication complexity, direct sum fails for average communication complexity as well as for external information complexity. Our example also refutes a version of a conjecture by Braverman et al. that in the zero-error case amortized communication complexity equals external information complexity. In our examples the underlying distributions do not have full support. One interpretation of a distribution of non full support is as a promise given to the players (the players have a guarantee on their inputs). This brings up the issue of promise versus non-promise problems in this context.
引用
收藏
页码:782 / 795
页数:14
相关论文
共 50 条
  • [31] Increasing the Output Length of Zero-Error Dispersers
    Gabizon, Ariel
    Shaltiel, Ronen
    [J]. APPROXIMATION RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, PROCEEDINGS, 2008, 5171 : 430 - +
  • [32] On the zero-error capacity of channels with noisy feedback
    Asadi, Meysam
    Devroye, Natasha
    [J]. 2017 55TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2017, : 642 - 649
  • [33] Secure Estimation and Zero-Error Secrecy Capacity
    Wiese, Moritz
    Oechtering, Tobias J.
    Johansson, Karl Henrik
    Papadimitratos, Panagiotis
    Sandberg, Henrik
    Skoglund, Mikael
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2019, 64 (03) : 1047 - 1062
  • [34] Zero-Error Capacity of the Chemical Residual Channel
    Cao, Qi
    Zhou, Qiaoqiao
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (02) : 854 - 864
  • [35] On zero-error codes produced by greedy algorithms
    Marcin Jurkiewicz
    [J]. Journal of Combinatorial Optimization, 2022, 44 : 2963 - 2980
  • [36] Zero-Error Capacity Regions of Noisy Networks
    Cao, Qi
    Yeung, Raymond W.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (07) : 4201 - 4223
  • [37] Quantum zero-error algorithms cannot be composed
    Buhrman, H
    de Wolf, R
    [J]. INFORMATION PROCESSING LETTERS, 2003, 87 (02) : 79 - 84
  • [38] Zero-error codes for correlated information sources
    Al Jabri, AK
    Al-Issa, S
    [J]. CRYPTOGRAPHY AND CODING, PROCEEDINGS, 1997, 1355 : 17 - 22
  • [39] The Birthday Problem and Zero-Error List Codes
    Noorzad, Parham
    Effros, Michelle
    Langberg, Michael
    Kostina, Victoria
    [J]. 2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 1648 - 1652
  • [40] Maximum privacy without coherence, zero-error
    Leung, Debbie
    Yu, Nengkun
    [J]. JOURNAL OF MATHEMATICAL PHYSICS, 2016, 57 (09)