On tight separation for Blum measures applied to Turing machine buffer complexity

DOI10.3233/FI-2017-1526MaRDI QIDQ4595602zbMATH OpenFDO

Authors Jiří Šíma, Stanislav Zak

Publication date 5 December 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• A Turing machine distance hierarchy
• scientific article; zbMATH DE number 2172794
• A note on Blum static complexity measures
• Nonuniform complexity classes specified by lower and upper bounds
• Sublogarithmic Bounds on Space and Reversals

Cited in

(2)

• Blum Static Complexity and Encoding Spaces
• A Turing machine distance hierarchy

This page was built for publication: On tight separation for Blum measures applied to Turing machine buffer complexity

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