Pages that link to "Item:Q1575880"
From MaRDI portal
The following pages link to LOGSPACE and PTIME characterized by programming languages (Q1575880):
Displaying 28 items.
- Logarithmic space and permutations (Q276248) (← links)
- Computation by interaction for space-bounded functional programming (Q276265) (← links)
- Regressive computations characterize logarithmic space (Q342702) (← links)
- Quasi-interpretations. A way to control resources (Q541228) (← links)
- Unbounded recursion and non-size-increasing functions (Q737105) (← links)
- Simple programming languages and restricted classes of Turing machines (Q792760) (← links)
- Complexity classes and fragments of C (Q1029017) (← links)
- Some relationships between logics of programs and complexity theory (Q1106839) (← links)
- Logical and schematic characterization of complexity classes (Q1323362) (← links)
- A predicative and decidable characterization of the polynomial classes of languages (Q1589422) (← links)
- Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\) (Q1683704) (← links)
- Logspace and logtime leaf languages (Q1817219) (← links)
- An abstract approach to stratification in linear logic (Q2343125) (← links)
- A higher-order characterization of probabilistic polynomial time (Q2343130) (← links)
- On quasi-interpretations, blind abstractions and implicit complexity (Q2909730) (← links)
- Bounded minimalisation and bounded counting in argument-bounded idc's (Q3060189) (← links)
- Limiting characterizations of low level space complexity classes (Q3142271) (← links)
- A Characterisation of the Relations Definable in Presburger Arithmetic (Q3502652) (← links)
- Pure Iteration and Periodicity (Q3507417) (← links)
- Recursion in Higher Types and Resource Bounded Turing Machines (Q3507448) (← links)
- A Refinement of the μ-measure for Stack Programs (Q4916234) (← links)
- Term rewriting characterisation of LOGSPACE for finite and infinite data (Q4993339) (← links)
- (Q5020650) (← links)
- Ramified Corecurrence and Logspace (Q5739361) (← links)
- Subclasses of \textsc{Ptime} interpreted by programming languages (Q6109064) (← links)
- Read/write factorizable programs (Q6113488) (← links)
- Towards the complexity analysis of programming language proof methods (Q6605344) (← links)
- Reasonable space for the \(\lambda \)-calculus, logarithmically (Q6649482) (← links)
