Abstract
Let EH be the hypothesis that a certain type of expander graph has an explicit construction. Let io-SPACE(T(n)) be the class of problems solvable by algorithms which for infinitely many inputs use at most space t(n). Then the following holds:
There exists ε>0 such that for any time bound t(n),
Research supported in part by NSF Grant MCS-8304769 and Air Force Grant AFOSR-82-0326.
Preview
Unable to display preview. Download preview PDF.
References
Pippenger, Superconcentrators, Siam J Comp 6, 1977, 298–304.
Klawe, Non-existence of one dimensional expanding graphs, FOCS 22, 1981, 109–114.
Pinsker, On the complexity of a concentrator, 1973.
Gabber, Galil, Explicit constructions of linear size concentrators, FOCS 20, 1979, 364–370.
Margulis, Explicit constructions of concentrators, Prob of Infor Trans, 1975.
Hopcroft, Paul, Valiant, On time versus space and related problems, FOCS 1976.
Blum, Micali, How to generate cryptographically strong sequences of pseudo-random bits, Siam J Comp 13, 1984, 850–863.
Yao, Theory and application of trapdoor functions, FOCS 23, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sipser, M. (1986). Expanders, randomness, or time versus space. In: Selman, A.L. (eds) Structure in Complexity Theory. Lecture Notes in Computer Science, vol 223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16486-3_108
Download citation
DOI: https://doi.org/10.1007/3-540-16486-3_108
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16486-9
Online ISBN: 978-3-540-39825-7
eBook Packages: Springer Book Archive