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 条

[21] Truth vs. Proof in computational complexity
Barak, Boaz
[J]. Barak, B. (b@boazbarak.org), 1600, European Association for Theoretical Computer Science, C/O Ioannis Chatzigiannakis, 1 N. Kazantzaki Str.,Rio, 26504, Greece (108): : 131 - 142
[22] From Query Complexity to Computational Complexity
Dobzinski, Shahar
Vondrak, Jan
[J]. STOC'12: PROCEEDINGS OF THE 2012 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2012, : 1107 - 1116
[23] Linguistic Complexity: English vs. Polish, Text vs. Corpus
Kwapien, J.
Drozdz, S.
Orczyk, A.
[J]. ACTA PHYSICA POLONICA A, 2010, 117 (04) : 716 - 720
[24] Synopses for query optimization: A space-complexity perspective
Kaushik, R
Naughton, JF
Ramakrishnan, R
Chakravarthy, VT
[J]. ACM TRANSACTIONS ON DATABASE SYSTEMS, 2005, 30 (04): : 1102 - 1127
[25] From quantum query complexity to state complexity
Zheng, Shenggen
Qiu, Daowen
[J]. Qiu, Daowen, 1600, Springer Verlag (8808): : 231 - 245
[26] Lifting query complexity to time-space complexity for two-way finite automata
Zheng, Shenggen
Li, Yaqiao
Pan, Minghua
Gruska, Jozef
Li, Lvzhou
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2024, 141
[27] On P vs. NP and Geometric Complexity Theory
Mulmuley, Ketan D.
[J]. JOURNAL OF THE ACM, 2011, 58 (02)
[28] Chaos: Algorithmic complexity vs. dynamical instability
Batterman, RW
[J]. LAW AND PREDICTION IN THE LIGHT OF CHAOS RESEARCH, 1996, 473 : 211 - 235
[29] Accuracy vs. complexity: OPC solutions and tradeoffs
Balasinski, A
Iandolo, W
Banachowicz, B
Staud, W
Ma, M
Sweis, J
[J]. 19TH EUROPEAN CONFERENCE ON MASK TECHNOLOGY FOR INTEGRATED CIRCUITS AND MICROCOMPONENTS, 2003, 5148 : 32 - 41
[30] An Empirical Investigation of End-User Query Development: The Effects of Improved Model Expressiveness vs. Complexity
Bowen, Paul L.
O'Farrell, Robert A.
Rohde, Fiona H.
[J]. INFORMATION SYSTEMS RESEARCH, 2009, 20 (04) : 565 - 584

← 1 2 3 4 5 →