scientific article
From MaRDI portal
Publication:3929053
zbMath0474.68064MaRDI QIDQ3929053
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (5)
Programmed grammars and their relation to the LBA problem ⋮ If deterministic and nondeterministic space complexities are equal for log log n then they are also equal for log n ⋮ If deterministic and nondeterministic space complexities are equal for log log n, then they are also equal for log n ⋮ Descriptional and computational complexity of finite automata -- a survey ⋮ One-Time Nondeterministic Computations
This page was built for publication:
