scientific article; zbMATH DE number 17551
From MaRDI portal
Publication:3974876
zbMATH Open0756.68043MaRDI QIDQ3974876FDOQ3974876
Theodore A. Slaman, Wolfgang Maass
Publication date: 26 June 1992
Title of this publication is not available (Why is that?)
Recommendations
- Timed Sets, Functional Complexity, and Computability
- scientific article
- 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
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (11)
- Sharply bounded alternation and quasilinear time
- Title not available (Why is that?)
- The Density of Linear-Time Properties
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strong extension axioms and Shelah's zero-one law for choiceless polynomial time
- A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes
- 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)
