Pages that link to "Item:Q1207333"
From MaRDI portal
The following pages link to A new recursion-theoretic characterization of the polytime functions (Q1207333):
Displayed 50 items.
- Linear logic by levels and bounded time complexity (Q1044841) (← links)
- A decidable characterization of the classes between lintime and exptime (Q1045888) (← links)
- A new recursion-theoretic characterization of the polytime functions (Q1207333) (← links)
- A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
- Sequences, datalog, and transducers (Q1278034) (← links)
- Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity (Q1295429) (← links)
- \({\mathcal M}^\omega\) considered as a programming language (Q1304541) (← links)
- Functions over free algebras definable in the simply typed lambda calculus (Q1314357) (← links)
- Function-algebraic characterizations of log and polylog parallel time (Q1332666) (← links)
- Analysing the implicit complexity of programs. (Q1401939) (← links)
- Linear types and non-size-increasing polynomial time computation. (Q1401943) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Continuous-time computation with restricted integration capabilities (Q1434373) (← links)
- Higher type recursion, ramification and polynomial time (Q1577477) (← links)
- Safe recursion with higher types and BCK-algebra (Q1577481) (← links)
- A predicative and decidable characterization of the polynomial classes of languages (Q1589422) (← links)
- On sharing, memoization, and polynomial time (Q1640979) (← links)
- A type-based complexity analysis of object oriented programs (Q1640983) (← links)
- A survey of recursive analysis and Moore's notion of real computation (Q1761708) (← links)
- Control structures in programs and computational complexity (Q1772780) (← links)
- Elementary arithmetic (Q1772782) (← links)
- Separating NC along the \(\delta\) axis (Q1827390) (← links)
- Minimization and \(\mathbf{NP}\) multifunctions (Q1827394) (← links)
- On the computational complexity of imperative programming languages (Q1827396) (← links)
- On an interpretation of safe recursion in light affine logic (Q1827399) (← links)
- A characterization of alternating log time by ramified recurrence (Q1978645) (← links)
- Type-two polynomial-time and restricted lookahead (Q1989320) (← links)
- Combining linear logic and size types for implicit complexity (Q1989323) (← links)
- The polynomial hierarchy of functions and its levels (Q2062128) (← links)
- Implicit recursion-theoretic characterizations of counting classes (Q2085583) (← links)
- A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations (Q2104133) (← links)
- On the power of recursive word-functions without concatenation (Q2112176) (← links)
- \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs (Q2119987) (← links)
- On efficiency of notations for natural numbers (Q2143116) (← links)
- Algorithmically broad languages for polynomial time and space (Q2148807) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) (Q2232317) (← links)
- Structural recursion as a query language on lists and ordered trees (Q2272218) (← links)
- Predicatively computable functions on sets (Q2339966) (← links)
- On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy (Q2343123) (← links)
- An abstract approach to stratification in linear logic (Q2343125) (← links)
- Formal security proofs with minimal fuss: implicit computational complexity at work (Q2343128) (← links)
- A higher-order characterization of probabilistic polynomial time (Q2343130) (← links)
- A new order-theoretic characterisation of the polytime computable functions (Q2346988) (← links)
- Characterizing polynomial time complexity of stream programs using interpretations (Q2346991) (← links)
- Realizability models for a linear dependent PCF (Q2346992) (← links)
- Applicative theories for logarithmic complexity classes (Q2346995) (← links)
- Complexity of the search for the least solution to a system of dictionary equations of exponential type (Q2356507) (← links)
- Implicit complexity over an arbitrary structure: Quantifier alternations (Q2490113) (← links)
- An arithmetic for polynomial-time computation (Q2500489) (← links)
- Resource control for synchronous cooperative threads (Q2503040) (← links)