scientific article; zbMATH DE number 806743
From MaRDI portal
Publication:4850544
zbMath0841.03022MaRDI QIDQ4850544
Publication date: 16 July 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (15)
Algebraic and logical characterizations of deterministic linear time classes ⋮ On sharing, memoization, and polynomial time ⋮ Algorithmically broad languages for polynomial time and space ⋮ Computation models and function algebras ⋮ Characterizing parallel time by type 2 recursions with polynomial output length ⋮ Continuous-time computation with restricted integration capabilities ⋮ Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH ⋮ Implicit complexity over an arbitrary structure: Quantifier alternations ⋮ The polynomial hierarchy of functions and its levels ⋮ Minimization and \(\mathbf{NP}\) multifunctions ⋮ On the computational complexity of imperative programming languages ⋮ A decidable characterization of the classes between lintime and exptime ⋮ Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity ⋮ A predicative and decidable characterization of the polynomial classes of languages ⋮ A higher-order characterization of probabilistic polynomial time
This page was built for publication:
