Space Complexity Vs. Query Complexity

被引：0
|
作者：
Oded Lachish
Ilan Newman
Asaf Shapira
机构：
[1] University of Warwick,Centre for Discrete Mathematics and its Applications (DIMAP), Department of Computer Science
[2] University of Haifa,Department of Computer Science
[3] Theory Group,undefined
[4] Microsoft Research,undefined
来源：
computational complexity | 2008年 / 17卷
关键词：
Bounded space; complexity; lower bounds; property testing; 68Q15; 68Q10;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies the property or is “far” from satisfying it. The main focus of property testing is in identifying large families of properties that can be tested with a certain number of queries to the input. In this paper we study the relation between the space complexity of a language and its query complexity. Our main result is that for any space complexity s(n) ≤ log n there is a language with space complexity O(s(n)) and query complexity 2Ω(s(n)).
引用
收藏
页码：70 / 93
页数：23
相关论文
共 50 条
  • [41] Dynamical complexity of short and noisy time seriesCompression-Complexity vs. Shannon entropy
    Nithin Nagaraj
    Karthi Balasubramanian
    The European Physical Journal Special Topics, 2017, 226 : 2191 - 2204
  • [42] Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
    Kowalski, DR
    Pelc, A
    THEORETICAL COMPUTER SCIENCE, 2005, 333 (03) : 355 - 371
  • [43] The Partition Bound for Classical Communication Complexity and Query Complexity
    Jain, Rahul
    Klauck, Hartmut
    25TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY - CCC 2010, 2010, : 247 - 258
  • [44] Natural language query vs. keyword search: Effects of task complexity on search performance, participant perceptions, and preferences
    Wang, QY
    Nass, C
    Hu, J
    HUMAN-COMPUTER INTERACTION - INTERACT 2005, PROCEEDINGS, 2005, 3585 : 106 - 116
  • [45] Learning Complexity vs Communication Complexity
    Linial, Nati
    Shraibman, Adi
    COMBINATORICS PROBABILITY & COMPUTING, 2009, 18 (1-2): : 227 - 245
  • [46] Sequential vs. parallel complexity in simple gene assembly
    Langille, Miika
    Petre, Ion
    THEORETICAL COMPUTER SCIENCE, 2008, 395 (01) : 24 - 30
  • [47] Chaos: Algorithmic complexity vs. dynamical instability - Discussion
    Batterman, RW
    Chirikov, B
    Miller, D
    Noyes, HP
    Suppes, P
    LAW AND PREDICTION IN THE LIGHT OF CHAOS RESEARCH, 1996, 473 : 236 - 242
  • [48] Local vs. Global Interpretability: A Computational Complexity Perspective
    Bassan, Shahaf
    Amir, Guy
    Katz, Guy
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, 2024, 235
  • [49] Self-assembled networks: Control vs. complexity
    Patwardhan, Jaidev P.
    Dwyer, Chris
    Lebeck, Alvin R.
    2006 1ST INTERNATIONAL CONFERENCE ON NANO-NETWORKS AND WORKSHOPS, 2006, : 49 - 53
  • [50] THE COMPLEXITY OF SUPPLY CHAIN vs. SURVIVAL OF THIS SUPPLY CHAIN
    Hoffa-Dabrowska, P.
    Grzybowska, K.
    24TH INTERNATIONAL CONFERENCE ON PRODUCTION RESEARCH (ICPR), 2017, : 87 - 92
12345