Pages that link to "Item:Q1207333"
From MaRDI portal
The following pages link to A new recursion-theoretic characterization of the polytime functions (Q1207333):
Displaying 50 items.
- A combination framework for complexity (Q276251) (← links)
- Higher-order interpretations and program complexity (Q276254) (← links)
- Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits (Q276257) (← links)
- Bounded combinatory logic and lower complexity (Q276270) (← links)
- Reverse complexity (Q287279) (← links)
- Safe recursion revisited. I: Categorical semantics for lower complexity (Q386608) (← links)
- Quasi-interpretations. A way to control resources (Q541228) (← links)
- A recursion-theoretic approach to NP (Q639668) (← links)
- A proof-theoretic characterization of the basic feasible functionals (Q706620) (← links)
- Two algorithms in search of a type-system (Q733753) (← links)
- Simulation of simultaneous safe recursion over an arbitrary structure (Q845681) (← links)
- Light affine lambda calculus and polynomial time strong normalization (Q877259) (← links)
- Cobham recursive set functions (Q904151) (← links)
- Soft linear set theory (Q941435) (← links)
- Light types for polynomial time computation in lambda calculus (Q1004289) (← links)
- Complexity classes and fragments of C (Q1029017) (← links)
- A foundation for real recursive function theory (Q1032628) (← links)
- Implicit characterizations of FPTIME and NC revisited (Q1044672) (← links)
- Quantum implicit computational complexity (Q1044836) (← links)
- 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)
