scientific article
From MaRDI portal
Publication:3326840
zbMath0539.68040MaRDI QIDQ3326840
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
regularityspace complexityone-way Turing machineprobabilistic Turing machinereversal complexityprobabilistic recognition
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes ⋮ Complexity of probabilistic versus deterministic automata ⋮ Uncountable realtime probabilistic classes ⋮ Lower space bounds for randomized computation ⋮ Lower time bounds for randomized computation ⋮ A survey of space complexity ⋮ Alternating space is closed under complement and other simulations for sublogarithmic space
This page was built for publication: