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 16 items.
- 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)
- 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)
- 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)
- Bounded Linear Logic, Revisited (Q5902142) (← links)