Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Szepietowski:1990:IDN,
author = "A. Szepietowski",
title = "If deterministic and nondeterministic space
complexities are equal for $\log \log n$, then they are
also equal for $\log n$",
journal = j-THEOR-COMP-SCI,
volume = "74",
number = "1",
pages = "115--119",
day = "30",
month = jul,
year = "1990",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Math., Tech. Univ. of Gdansk, Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; deterministic space
complexity; nondeterministic space complexities",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}