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 27 items.
- 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)
- Feasible set functions have small circuits (Q5240585) (← 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)
- Time-Complexity Semantics for Feasible Affine Recursions (Q5425322) (← 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)
- Read/write factorizable programs (Q6113488) (← links)
- A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations (Q6116835) (← links)
- Theoretical computer science: computational complexity (Q6602263) (← links)
- Towards the complexity analysis of programming language proof methods (Q6605344) (← links)
- On basic feasible functionals and the interpretation method (Q6629518) (← links)
- Cyclic implicit complexity (Q6649449) (← links)
