Andrzej Szepietowski If Deterministic and Nondeterministic Space Complexities are Equal for log log n then they are also Equal for log n. [Citation Graph (0, 0)][DBLP] STACS, 1989, pp:251-255 [Conf]
Andrzej Szepietowski A week mode of space complexity can be used in the proof that [DSPACE(log log n) = NSPACE(log logn)] => [L = NL]. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1990, v:40, n:, pp:266-269 [Journal]
Andrzej Szepietowski There are no Fully Space Constructible Functions Between log log n and log n. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1987, v:24, n:6, pp:361-362 [Journal]
Andrzej Szepietowski Some Remarks on the Alternating Hierarchy and Closure Under Complement for Sublogarithmic Space. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:33, n:2, pp:73-78 [Journal]
Andrzej Szepietowski If Deterministic and Nondeterministic Space Complexities are Equal for log log n, then they are also Equal for log n. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1990, v:74, n:1, pp:115-119 [Journal]
Search in 0.031secs, Finished in 0.032secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP