ON THE DISTRIBUTIONAL COMPLEXITY OF DISJOINTNESS

被引：0
|
作者：
RAZBOROV, AA
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1990年 / 443卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：249 / 253
页数：5
相关论文
共 50 条
  • [21] Distributional problems and the average-case complexity
    GROUP-BASED CRYPTOGRAPHY, 2008, : 99 - 115
  • [22] A direct sum theorem for corruption and the multiparty NOF communication complexity of set disjointness
    Beame, P
    Pitassi, T
    Segerlind, N
    Wigderson, A
    TWENTIETH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2005, : 52 - 66
  • [23] Evaluating the complexity of time series based on distributional orderliness
    Yu, Wen-Jing
    Yu, Jie
    Xu, Ling-Yu
    Zhang, Gao-Wei
    Guo, Shi-Wei
    Journal of Computers (Taiwan), 2019, 30 (05) : 159 - 171
  • [24] Speedy Categorical Distributional Reinforcement Learning and Complexity Analysis
    Boeck, Markus
    Heitzinger, Clemens
    SIAM JOURNAL ON MATHEMATICS OF DATA SCIENCE, 2022, 4 (02): : 675 - 693
  • [25] Communication and distributional complexity of joint probability mass functions
    Jaggi, S
    Effros, M
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 365 - 365
  • [26] Product recurrent properties, disjointness and weak disjointness
    Pandeng Dong
    Song Shao
    Xiangdong Ye
    Israel Journal of Mathematics, 2012, 188 : 463 - 507
  • [27] PRODUCT RECURRENT PROPERTIES, DISJOINTNESS AND WEAK DISJOINTNESS
    Dong, Pandeng
    Shao, Song
    Ye, Xiangdong
    ISRAEL JOURNAL OF MATHEMATICS, 2012, 188 (01) : 463 - 507
  • [28] Near-optimal bounds on bounded-round quantum communication complexity of disjointness
    Braverman, Mark
    Garg, Ankit
    Ko, Young Kun
    Mao, Jieming
    Touchette, Dave
    2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2015, : 773 - 791
  • [29] The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection
    Kushilevitz, Eyal
    Weinreb, Enav
    2009 50TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE: FOCS 2009, PROCEEDINGS, 2009, : 63 - 72
  • [30] NEAR-OPTIMAL BOUNDS ON THE BOUNDED-ROUND QUANTUM COMMUNICATION COMPLEXITY OF DISJOINTNESS
    Braverman, Mark
    Garg, Ankit
    Ko, Young Kun
    Mao, Jieming
    Touchette, Dave
    SIAM JOURNAL ON COMPUTING, 2018, 47 (06) : 2277 - 2314
12345