scientific article
From MaRDI portal
Publication:4038686
zbMath0765.68035MaRDI QIDQ4038686
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
nondeterministic Turing machinesnondeterministically space constructible functionsspace complexity theory
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (3)
Space bounded computations: Review and new separation results ⋮ A survey of space complexity ⋮ The alternation hierarchy for sublogarithmic space is infinite
This page was built for publication: