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.
- On the power of recursive word-functions without concatenation (Q2112176) (← links)
- \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs (Q2119987) (← links)
- On efficiency of notations for natural numbers (Q2143116) (← links)
- Algorithmically broad languages for polynomial time and space (Q2148807) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) (Q2232317) (← links)
- Structural recursion as a query language on lists and ordered trees (Q2272218) (← links)
- Predicatively computable functions on sets (Q2339966) (← links)
- On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy (Q2343123) (← links)
- An abstract approach to stratification in linear logic (Q2343125) (← links)
- Formal security proofs with minimal fuss: implicit computational complexity at work (Q2343128) (← links)
- A higher-order characterization of probabilistic polynomial time (Q2343130) (← links)
- A new order-theoretic characterisation of the polytime computable functions (Q2346988) (← links)
- Characterizing polynomial time complexity of stream programs using interpretations (Q2346991) (← links)
- Realizability models for a linear dependent PCF (Q2346992) (← links)
- Applicative theories for logarithmic complexity classes (Q2346995) (← links)
- Complexity of the search for the least solution to a system of dictionary equations of exponential type (Q2356507) (← links)
- Implicit complexity over an arbitrary structure: Quantifier alternations (Q2490113) (← links)
- An arithmetic for polynomial-time computation (Q2500489) (← links)
- Resource control for synchronous cooperative threads (Q2503040) (← links)
- 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)