scientific article; zbMATH DE number 177808

zbMATH Open0765.68035MaRDI QIDQ4038686FDOQ4038686

Authors: Viliam Geffert 

Publication date: 18 May 1993

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

Recommendations

• Nondeterministic Computations in Sublogarithmic Space and Space Constructibility
• If deterministic and nondeterministic space complexities are equal for log log n, then they are also equal for log n
• Bridging across the \(\log(n)\) space frontier
• Space bounded computations: Review and new separation results
• Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties

zbMATH Keywords

nondeterministic Turing machinesnondeterministically space constructible functionsspace complexity theory

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (7)

• Title not available (Why is that?)
• Space bounded computations: Review and new separation results
• Title not available (Why is that?)
• The alternation hierarchy for sublogarithmic space is infinite
• Title not available (Why is that?)
• Sublogarithmic Bounds on Space and Reversals
• A survey of space complexity

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 Q4038686)