Weak and strong one-way space complexity classes

DOI10.1016/S0020-0190(98)00176-8zbMATH Open1339.68100MaRDI QIDQ293473FDOQ293473

Authors: Andrzej Szepietowski 

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001768?np=y

Recommendations

• Deterministic one-way Turing machines with sublinear space
• One pebble versus \(\varepsilon\cdot\log n\) bits
• scientific article; zbMATH DE number 3858415
• scientific article; zbMATH DE number 3887666
• A survey of space complexity

zbMATH Keywords

computational complexityone-way Turing machinestrong space complexityweak space complexity

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Title not available (Why is that?)
• Nondeterministic Space is Closed under Complementation
• The method of forced enumeration for nondeterministic automata
• Halting space-bounded computations
• Turing machines with sublogarithmic space
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nondeterministic Computations in Sublogarithmic Space and Space Constructibility
• Tally Versions of the Savitch and Immerman–Szelepcsényi Theorems for Sublogarithmic Space

Cited In (1)

• Extension complexity of formal languages

This page was built for publication: Weak and strong one-way space complexity classes

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