scientific article; zbMATH DE number 17551

MaRDI QIDQ3974876zbMATH OpenFDO

Authors Theodore A. Slaman, Wolfgang Maass

Publication date 26 June 1992

zbMATH Keywords

complexity typetime complexity classes for RAM's

Mathematics Subject Classification ID

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

Recommendations

• Timed Sets, Functional Complexity, and Computability
• scientific article; zbMATH DE number 4130363
• A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes
• On genuinely time bounded computations
• Lowness Properties of Sets in the Exponential-Time Hierarchy
• Strong time bounds: Non-computable bounds and a hierarchy theorem
• scientific article; zbMATH DE number 1072532
• Parameterized complexity and subexponential-time computability
• A generalization of extension complexity that captures P
• Almost-everywhere complexity hierarchies for nondeterministic time

Cited in

(11)

• Sharply bounded alternation and quasilinear time
• scientific article; zbMATH DE number 65752 (Why is no real title available?)
• The Density of Linear-Time Properties
• scientific article; zbMATH DE number 4130363 (Why is no real title available?)
• scientific article; zbMATH DE number 4160709 (Why is no real title available?)
• A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes
• Strong extension axioms and Shelah's zero-one law for choiceless polynomial time
• Time-Complexity Semantics for Feasible Affine Recursions
• The complexity types of computable sets
• The Descriptive Complexity of the Deterministic Exponential Time Hierarchy
• Timed Sets, Functional Complexity, and Computability

This page was built for publication:

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