scientific article; zbMATH DE number 3540744
From MaRDI portal
Publication:4116394
zbMath0346.94027MaRDI QIDQ4116394
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Turing machines and related notions (03D10)
Related Items (3)
Complexity of probabilistic versus deterministic automata ⋮ Lower space bounds for randomized computation ⋮ Lower time bounds for randomized computation
This page was built for publication:
