scientific article; zbMATH DE number 3407150

zbMath0257.68037MaRDI QIDQ5672171

Patrick C. Fischer, S. S. Ruby

Publication date: 1965

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Turing machines and related notions (03D10)

Related Items (18)

An application of the translational method ⋮ On restricted turing computability ⋮ New time hierarchy results for deterministic TMS ⋮ On time hierarchies ⋮ A hierarchy for nondeterministic time complexity ⋮ Complexity of algorithms and computations ⋮ Symmetric space-bounded computation ⋮ Multihead two-way probabilistic finite automata ⋮ Towards separating nondeterminism from determinism ⋮ Translational lemmas, polynomial time, and \((\log n)^j\)-space ⋮ Comparing complexity classes ⋮ Techniques for separating space complexity classes ⋮ Almost-everywhere complexity hierarchies for nondeterministic time ⋮ Tighter constant-factor time hierarchies ⋮ A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes ⋮ Parallel turing machines with one-head control units and cellular automata ⋮ On two-way multihead automata ⋮ Data structures for distributed counting

This page was built for publication: