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 8 items.
- 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)