scientific article
From MaRDI portal
Publication:3747727
zbMATH Open0608.68037MaRDI QIDQ3747727
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)
Related Items (8)
Unnamed Item ⋮ Element distinctness on one-tape Turing machines: a complete solution ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Logical Approaches to Computational Barriers ⋮ Unnamed Item
This page was built for publication:
