scientific article

zbMath0421.68050MaRDI QIDQ3854629

Stanislav Zak

Publication date: 1979

Full work available at URL: https://eudml.org/doc/27632

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

zbMATH Keywords

diagonalizationoraclepushdown automatacounter machinescomputation on Turing machineshierarchy for space complexity measure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

On the complexity of deciding fair termination of probabilistic concurrent finite-state programs ⋮ A Turing machine time hierarchy ⋮ Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs ⋮ Complexity lower bounds for machine computing models

Cites Work

• Techniques for separating space complexity classes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: