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 19 items.
- 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)
- Computation models and function algebras (Q6064278) (← links)
- Expressing computational complexity in constructive type theory (Q6064279) (← links)
- Intrinsic theories and computational complexity (Q6064281) (← links)
- Characterizing parallel time by type 2 recursions with polynomial output length (Q6064285) (← links)
- A programming language characterizing quantum polynomial time (Q6091186) (← 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)
- Complete and tractable machine-independent characterizations of second-order polytime (Q6181938) (← links)