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.
- Inductive definitions over a predicative arithmetic (Q2566072) (← links)
- Unary Resolution: Characterizing Ptime (Q2811353) (← links)
- Feasible functionals and intersection of ramified types (Q2842842) (← links)
- Discrete Transfinite Computation (Q2906573) (← links)
- On quasi-interpretations, blind abstractions and implicit complexity (Q2909730) (← links)
- Computational Complexity Via Finite Types (Q2946764) (← links)
- Build your own clarithmetic I: Setup and completeness (Q2974779) (← links)
- The Power of Non-determinism in Higher-Order Implicit Complexity (Q2988663) (← links)
- The computational SLR: a logic for reasoning about computational indistinguishability (Q3060197) (← links)
- A Formalization of Polytime Functions (Q3088001) (← links)
- A Short Introduction to Implicit Computational Complexity (Q3166988) (← links)
- A Categorical Setting for Lower Complexity (Q3178259) (← links)
- Pointwise Transfinite Induction and a Miniaturized Predicativity (Q3305563) (← links)
- Tiering as a Recursion Technique (Q3370611) (← links)
- 2004 Summer Meeting of the Association for Symbolic Logic (Q3370624) (← links)
- 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05 (Q3430941) (← links)
- Parsimonious Types and Non-uniform Computation (Q3449488) (← links)
- SAFE RECURSIVE SET FUNCTIONS (Q3450802) (← links)
- A Characterization of NC k by First Order Functional Programs (Q3502640) (← links)
- Recursion Schemata for NC k (Q3540170) (← links)
- A lexicographic path order with slow growing derivation bounds (Q3619873) (← links)
- 10th Asian Logic Conference (Q3633210) (← links)
- Dependency Pairs and Polynomial Path Orders (Q3636818) (← links)
- The Computational SLR: A Logic for Reasoning about Computational Indistinguishability (Q3637209) (← links)
- How is it that infinitary methods can be applied to finitary mathematics? Gödel's <i>T</i>: a case study (Q4254685) (← links)
- An Application of Category-Theoretic Semantics to the Characterisation of Complexity Classes Using Higher-Order Function Algebras (Q4382502) (← links)
- A new “feasible” arithmetic (Q4532603) (← links)
- (Q4580325) (← links)
- An analysis of the Core-ML language: Expressive power and type reconstruction (Q4632418) (← links)
- Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH (Q4916232) (← links)
- The Garland Measure and Computational Complexity of Stack Programs (Q4916233) (← links)
- A Refinement of the μ-measure for Stack Programs (Q4916234) (← links)
- A Calculus for Game-Based Security Proofs (Q4933210) (← links)
- (Q5013812) (← links)
- Algebraic and logical characterizations of deterministic linear time classes (Q5048946) (← links)
- V-comprehensions and P space (Q5057477) (← links)
- (Q5079730) (← links)
- A recursion-theoretic characterisation of the positive polynomial-time functions (Q5079742) (← links)
- (Q5089032) (← links)
- Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations (Q5092382) (← links)
- (Q5094117) (← links)
- Tiered Arithmetics (Q5214784) (← links)
- LAMBDA-REPRESENTABLE FUNCTIONS OVER TERM ALGEBRAS (Q5249246) (← links)
- Proof-Theoretic Semantics and Feasibility (Q5250217) (← links)
- 2007 European Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '07 (Q5387300) (← links)
- Complexity Analysis by Rewriting (Q5458433) (← links)
- Ramified Corecurrence and Logspace (Q5739361) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
- Bounded Linear Logic, Revisited (Q5902142) (← links)
- On parallel hierarchies and R ki (Q6064276) (← links)