scientific article; zbMATH DE number 2079048
From MaRDI portal
Publication:4474861
Recommendations
Cited in
(36)- A decidable characterization of the classes between lintime and exptime
- Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
- Higher type recursion, ramification and polynomial time
- Safe recursion with higher types and BCK-algebra
- A predicative and decidable characterization of the polynomial classes of languages
- On the computational complexity of imperative programming languages
- A characterization of alternating log time by ramified recurrence
- A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations
- \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs
- Algorithmically broad languages for polynomial time and space
- A higher-order characterization of probabilistic polynomial time
- Implicit complexity over an arbitrary structure: Quantifier alternations
- An arithmetic for polynomial-time computation
- The role of polymorphism in the characterisation of complexity by soft types
- Bounded combinatory logic and lower complexity
- Soft linear logic and polynomial complexity classes
- Computational Complexity Via Finite Types
- A Short Introduction to Implicit Computational Complexity
- A categorical setting for lower complexity
- Characterizing PSPACE with pointers
- Safe recursion revisited. I: Categorical semantics for lower complexity
- A Refinement of the μ-measure for Stack Programs
- scientific article; zbMATH DE number 1424029 (Why is no real title available?)
- Complexity analysis of precedence terminating infinite graph rewrite systems
- Formalizing termination proofs under polynomial quasi-interpretations
- V-comprehensions and P space
- Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations
- Quasi-interpretations. A way to control resources
- Ramified Corecurrence and Logspace
- Implicit computation complexity in higher-order programming languages
- Characterizing parallel time by type 2 recursions with polynomial output length
- A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations
- Cyclic implicit complexity
- A characterization of basic feasible functionals through higher-order rewriting and tuple interpretations
- Simulation of Turing machines with analytic discrete ODEs: polynomial-time and space over the reals characterised with discrete ordinary differential equations
- Cyclic implicit complexity
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 Q4474861)
