Weak and strong one-way space complexity classes

DOI10.1016/S0020-0190(98)00176-8MaRDI QIDQ293473zbMATH OpenFDO

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

zbMATH Keywords

computational complexityone-way Turing machinestrong space complexityweak space complexity

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3917711 (Why is no real title available?)
• scientific article; zbMATH DE number 3936519 (Why is no real title available?)
• scientific article; zbMATH DE number 3723863 (Why is no real title available?)
• scientific article; zbMATH DE number 3363526 (Why is no real title available?)
• Halting space-bounded computations
• Nondeterministic Computations in Sublogarithmic Space and Space Constructibility
• Nondeterministic Space is Closed under Complementation
• Tally Versions of the Savitch and Immerman–Szelepcsényi Theorems for Sublogarithmic Space
• The method of forced enumeration for nondeterministic automata
• Turing machines with sublogarithmic space

Cited in

(2)

• Deterministic one-way Turing machines with sublinear space
• 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)