scientific article; zbMATH DE number 3655356

zbMATH Open0421.68050MaRDI QIDQ3854629FDOQ3854629

Authors: Stanislav Zak 

Publication date: 1979

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

Title of this publication is not available (Why is that?)

zbMATH Keywords

counter machinespushdown automatadiagonalizationoraclecomputation on Turing machineshierarchy for space complexity measure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Techniques for separating space complexity classes
• Title not available (Why is that?)

Cited In (4)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3854629)