Abstract
We initiate a study of space-time tradeoffs in the cell-probe model under restricted preprocessing power. Classically, space-time tradeoffs have been studied in this model under the assumption that the preprocessing is unrestricted. In this setting, a large gap exists between the best known upper and lower bounds. Augmenting the model with a function family F that characterizes the preprocessing power, makes for a more realistic computational model and allows to obtain much tighter space-time tradeoffs for various natural settings of F. The extreme settings of our model reduce to the classical cell probe and generalized decision tree complexities.
We use graph properties for the purpose of illustrating various aspects of our model across this broad spectrum. In doing so, we develop new lower bound techniques and strengthen some existing results. In particular, we obtain near-optimal space-time tradeoffs for various natural choices of F; strengthen the Rivest-Vuillemin proof of the famous AKR conjecture to show that no non-trivial monotone graph property can be expressed as a polynomial of sub-quadratic degree; and obtain new results on the generalized decision tree complexity w.r.t. various families F.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Ajtai. A lower bound for finding predecessors in Yao’s cell probe model. In Combinatorica, 8:235–247, 1988.
A. Borodin, R. Ostrovsky, Y. Rabani. Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems. In Proc. of STOC, 1999.
A. Chakrabarti, B. Chazelle, B. Gum, A. Lvov. A good neighbor is hard to find. In Proc. of STOC, 1999.
P. Elias, R.A. Flower. The complexity of some simple retrieval problems. In J. ACM, 22:367–379, 1975.
A. Hajnal, W. Maass and G. Turan. On the communication complexity of graph properties. In Proc. of STOC, pp. 186–191, 1988.
P. Hajnal. An n 4/3 lower bound on the randomized complexity of graph properties. In Combinatorica, 11:131–143, 1991.
L. Hellerstein, P. Klein, R. Wilber. On the Time-Space Complexity of Reachability Queries for Preprocessed Graphs. In Information Processing Letters, 27:261–267, 1990.
J. Kahn, M. Saks, D. Sturtevant. A topological approach to evasiveness. In Proc. of FOCS, pp. 31–39, 1983.
E. Kushilevitz, N. Nisan. Communication Complexity. Cambridge University Press, 1997.
P. Miltersen. The bit probe complexity measure revisited. In Proc. of STACS, pp. 662–671, 1993.
P. Miltersen. Lower bounds for union-split-find related problems on random access machines. In Proc. STOC, pp. 625–634, 1994.
P. Miltersen. On cell probe complexity of polynomial evaluation. In Theoretical Computer Science, 143:167–174, 1995.
P. Miltersen, N. Nisan, S. Safra, A. Wigderson. On Data Structures and Asymmetric Communication Comlexity. In Proc. of STOC, pp. 103–111, 1995.
R. Rivest, J. Vuillemin. On recognizing graph properties from adjecency matrices. In Theoretical Computer Science, 3:371–384, 1976.
I. Wegener. The complexity of Boolean functions. In Wiley-Teubner series in Computer Science, 1987.
B. Xiao. New bounds in cell probe model. Ph.D. thesis, UC San Diego, 1992.
A. Yao. Should tables be sorted. In J. ACM, 28:615–628, 1981.
A. Yao. Some complexity questions related to distributed computing. In Proc. of STOC, pp. 209–213, 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dodis, Y., Khanna, S. (1999). Space-Time Tradeoffs for Graph Properties. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds) Automata, Languages and Programming. Lecture Notes in Computer Science, vol 1644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48523-6_26
Download citation
DOI: https://doi.org/10.1007/3-540-48523-6_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66224-2
Online ISBN: 978-3-540-48523-0
eBook Packages: Springer Book Archive