If deterministic and nondeterministic space complexities are equal for log log n, then they are also equal for log n
type: Item
instance of: scholarly article
title: If deterministic and nondeterministic space complexities are equal for log log n, then they are also equal for log n
zbMATH Open document ID: 0701.68033
DOI: 10.1016/0304-3975(90)90008-6
author: Andrzej Szepietowski
published in: Theoretical Computer Science
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 03D15
zbMATH DE Number: 4149547
zbMATH Keywords: space complexity
zbMATH Keywords: equality of complexity classes
zbMATH Keywords: space function
MaRDI profile type: Publication
full work available at URL: 0304-3975(90)90008-6
OpenAlex ID: W1586252286
cites work: Q3912023
cites work: Q5180413
cites work: Q3929053
cites work: Q3309910
cites work: Relationships between nondeterministic and deterministic tape complexities
cites work: Halting space-bounded computations
cites work: Remarks on languages acceptable in log log n space
description: scientific article; zbMATH DE number 4149547