scientific article; zbMATH DE number 2079048

zbMath1044.03526MaRDI QIDQ4474861

Daniel Leivant, Jean-Yves Marion

Publication date: 21 July 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (31)

\textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs ⋮ The role of polymorphism in the characterisation of complexity by soft types ⋮ Bounded combinatory logic and lower complexity ⋮ A Short Introduction to Implicit Computational Complexity ⋮ A Categorical Setting for Lower Complexity ⋮ V-comprehensions and P space ⋮ Algorithmically broad languages for polynomial time and space ⋮ Safe recursion revisited. I: Categorical semantics for lower complexity ⋮ Computational Complexity Via Finite Types ⋮ Characterizing parallel time by type 2 recursions with polynomial output length ⋮ Characterizing PSPACE with pointers ⋮ A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A characterization of alternating log time by ramified recurrence ⋮ A Refinement of the μ-measure for Stack Programs ⋮ Quasi-interpretations. A way to control resources ⋮ Ramified Corecurrence and Logspace ⋮ Implicit complexity over an arbitrary structure: Quantifier alternations ⋮ An arithmetic for polynomial-time computation ⋮ Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations ⋮ On the computational complexity of imperative programming languages ⋮ Higher type recursion, ramification and polynomial time ⋮ Safe recursion with higher types and BCK-algebra ⋮ 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 ⋮ A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations ⋮ Soft Linear Logic and Polynomial Complexity Classes ⋮ Implicit computation complexity in higher-order programming languages

This page was built for publication: