Query complexity lower bounds for reconstruction of codes

被引：0
|
作者：
Chakraborty, Sourav [1 ]
Fischer, Eldar [2 ]
Matsliah, Arie [3 ]
机构：
[1] Chennai Mathematical Institute, Chennai, India
[2] Faculty of Computer Science, Technion – Israel Institute of Technology, Technion City,Haifa,32000, Israel
[3] Google, Mountain View,CA, United States
来源：
Theory of Computing | 2014年 / 10卷
关键词：
Signal encoding - Decoding;
D O I：
10.4086/toc.2014.v010a019
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：513 / 533
相关论文
共 50 条
  • [21] Lower bounds on crosscorrelation of codes
    Levenshtein, V
    IEEE ISSSTA '96 - IEEE FOURTH INTERNATIONAL SYMPOSIUM ON SPREAD SPECTRUM TECHNIQUES & APPLICATIONS, PROCEEDINGS, VOLS 1-3, 1996, : 657 - 661
  • [22] Quantum query algorithms and lower bounds
    Ambainis, A
    Classical and New Paradigms of Computation and Their Complexity Hierarchies, 2004, 23 : 15 - 32
  • [23] A method to prove query lower bounds
    Jagadish, M.
    Iyer, Sridhar
    ITICSE 2014 - Proceedings of the 2014 Innovation and Technology in Computer Science Education Conference, 2014, : 81 - 86
  • [24] Optimal query complexity bounds for finding graphs
    Choi, Sung-Soon
    Kim, Jeong Han
    ARTIFICIAL INTELLIGENCE, 2010, 174 (9-10) : 551 - 569
  • [25] Optimal Query Complexity Bounds for Finding Graphs
    Choi, Sung-Soon
    Kim, Jeong Han
    STOC'08: PROCEEDINGS OF THE 2008 ACM INTERNATIONAL SYMPOSIUM ON THEORY OF COMPUTING, 2008, : 749 - 758
  • [26] Lower Bounds in Communication Complexity
    Lee, Troy
    Shraibman, Adi
    FOUNDATIONS AND TRENDS IN THEORETICAL COMPUTER SCIENCE, 2007, 3 (04): : 263 - 399
  • [27] LOWER BOUNDS FOR THE APPROXIMATIVE COMPLEXITY
    GRIESSER, B
    THEORETICAL COMPUTER SCIENCE, 1986, 46 (2-3) : 329 - 338
  • [28] Lower bounds for topological complexity
    Franc, Aleksandra
    Pavesic, Petar
    TOPOLOGY AND ITS APPLICATIONS, 2013, 160 (08) : 991 - 1004
  • [29] LOWER BOUNDS ON COMMUNICATION COMPLEXITY
    DURIS, P
    GALIL, Z
    SCHNITGER, G
    INFORMATION AND COMPUTATION, 1987, 73 (01) : 1 - 22
  • [30] Tight Query Complexity Lower Bounds for PCA via Finite Sample Deformed Wigner Law
    Simchowitz, Max
    El Alaoui, Ahmed
    Recht, Benjamin
    STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, : 1249 - 1259
12345