Weak and strong one-way space complexity classes

DOI10.1016/S0020-0190(98)00176-8zbMath1339.68100MaRDI QIDQ293473

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

Related Items (1)

Extension complexity of formal languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The method of forced enumeration for nondeterministic automata
• Halting space-bounded computations
• Turing machines with sublogarithmic space
• Nondeterministic Space is Closed under Complementation
• Nondeterministic Computations in Sublogarithmic Space and Space Constructibility
• Tally Versions of the Savitch and Immerman–Szelepcsényi Theorems for Sublogarithmic Space

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