LOGSPACE and PTIME characterized by programming languages
From MaRDI portal
Recommendations
- Some Programming Languages for Logspace and Ptime
- Logspace and logtime leaf languages
- An imperative language characterizing PTIME algorithms
- A logical characterization of timed pushdown languages
- Subclasses of \textsc{Ptime} interpreted by programming languages
- Logical hierarchies in PTIME
- scientific article; zbMATH DE number 947806
- Programming in metric temporal logic
- scientific article; zbMATH DE number 3985193
- A logical characterization of timed regular languages
Cited in
(33)- Logspace without bounds
- Computation by interaction for space-bounded functional programming
- Logarithmic space and permutations
- Regressive computations characterize logarithmic space
- A Refinement of the μ-measure for Stack Programs
- Programming languages capturing complexity classes
- Quasi-interpretations. A way to control resources
- Read/write factorizable programs
- Towards the complexity analysis of programming language proof methods
- Reasonable space for the \(\lambda \)-calculus, logarithmically
- Some Programming Languages for Logspace and Ptime
- Recursion in Higher Types and Resource Bounded Turing Machines
- A predicative and decidable characterization of the polynomial classes of languages
- Subclasses of \textsc{Ptime} interpreted by programming languages
- On quasi-interpretations, blind abstractions and implicit complexity
- Simple programming languages and restricted classes of Turing machines
- Logspace and logtime leaf languages
- Bounded minimalisation and bounded counting in argument-bounded idc's
- Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\)
- Computer Science Logic
- Some relationships between logics of programs and complexity theory
- A higher-order characterization of probabilistic polynomial time
- Ramified Corecurrence and Logspace
- Limiting characterizations of low level space complexity classes
- A Characterisation of the Relations Definable in Presburger Arithmetic
- Term rewriting characterisation of LOGSPACE for finite and infinite data
- An abstract approach to stratification in linear logic
- Pure Iteration and Periodicity
- Logic programming and logarithmic space
- scientific article; zbMATH DE number 7453191 (Why is no real title available?)
- An imperative language characterizing PTIME algorithms
- Complexity classes and fragments of C
- Unbounded recursion and non-size-increasing functions
This page was built for publication: LOGSPACE and PTIME characterized by programming languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575880)
