Descriptive complexity of deterministic polylogarithmic time

DOI10.1007/978-3-662-59533-6_13MaRDI QIDQ2303589zbMATH OpenOpenAlexFDO

Authors Flavio Ferrarotti, Jan Van den Bussche, Jonni Virtema, Senén González, Jose Maria Turull Torres

Publication date 4 March 2020

Full work available at URL https://arxiv.org/abs/1903.03413

Mathematics Subject Classification ID

Logic in computer science (03B70)

Recommendations

• Descriptive complexity of deterministic polylogarithmic time and space
• The Descriptive Complexity of the Deterministic Exponential Time Hierarchy
• scientific article; zbMATH DE number 1342206
• scientific article; zbMATH DE number 1424025
• Descriptive complexity of \(\#\)P functions
• Descriptive characterizations of computational complexity
• scientific article; zbMATH DE number 4106276
• scientific article; zbMATH DE number 17544
• scientific article; zbMATH DE number 1231505
• Descriptive complexity of \#P functions: a new perspective

Cited in

(4)

• Descriptive complexity of deterministic polylogarithmic time and space
• A note on deterministic and nondeterministic time complexity
• scientific article; zbMATH DE number 1424025 (Why is no real title available?)
• The Descriptive Complexity of the Deterministic Exponential Time Hierarchy

This page was built for publication: Descriptive complexity of deterministic polylogarithmic time

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