Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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.
Possibly Related PublicationsThe following publications are possibly variants of this publication: If Deterministic and Nondeterministic Space Complexities are Equal for ::::log log n:::: then they are also Equal for ::::log n::::Andrzej Szepietowski. STACS 1989: 251-255 Some Notes on Strong and Weak log log n Space ComplexityAndrzej Szepietowski. ipl, 33(2):109-112, 1989. There are no Fully Space Constructible Functions Between log log n and log nAndrzej Szepietowski. ipl, 24(6):361-362, 1987.
The following publications are possibly variants of this publication: