Andrzej Szepietowski. If Deterministic and Nondeterministic Space Complexities are Equal for ::::log log n::::, then they are also Equal for ::::log n::::. Theoretical Computer Science, 74(1):115-119, 1990.
@article{Szepietowski90-0,
title = {If Deterministic and Nondeterministic Space Complexities are Equal for ::::log log n::::, then they are also Equal for ::::log n::::},
author = {Andrzej Szepietowski},
year = {1990},
researchr = {https://researchr.org/publication/Szepietowski90-0},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {74},
number = {1},
pages = {115-119},
}