Measure theoretic completeness notions for the exponential time classes

DOI10.1007/3-540-44612-5_11MaRDI QIDQ4536350zbMATH OpenFDO

Authors Klaus Ambos-Spies

Publication date 4 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44612-5_11

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Genericity and measure for exponential time (extended abstract)
• \(\lozenge_\alpha \)-measurability and combined measure theory on time scales
• Genericity and measure for exponential time
• Nonuniform lower bounds for exponential time classes
• scientific article; zbMATH DE number 811606
• Weak completeness notions for exponential time
• Weak completeness notions for exponential time
• scientific article; zbMATH DE number 2164672
• On the complexity of expansive measures
• On the existence of equivalent -measures in finite discrete time

Cited in

(11)

• Exponential-time and subexponential-time sets
• Genericity and measure for exponential time
• Almost complete sets.
• Hard sets are hard to find
• Weak completeness notions for exponential time
• Weak completeness notions for exponential time
• scientific article; zbMATH DE number 1335891 (Why is no real title available?)
• The quantitative structure of exponential time
• Almost complete sets
• Genericity and measure for exponential time (extended abstract)
• A note on measuring in P

This page was built for publication: Measure theoretic completeness notions for the exponential time classes

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