Pages that link to "Item:Q1227276"
From MaRDI portal
The following pages link to Polynomial and abstract subrecursive classes (Q1227276):
Displayed 35 items.
- A proof-theoretic characterization of the basic feasible functionals (Q706620) (← links)
- Resource restricted computability theoretic learning: Illustrative topics and problems (Q733738) (← links)
- The basic feasible functionals in computable analysis (Q864439) (← links)
- Indexings of subrecursive classes (Q1140080) (← links)
- The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory (Q1193873) (← links)
- Nondiamond theorems for polynomial time reducibility (Q1201882) (← links)
- Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen (Q1243275) (← links)
- A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
- Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals (Q1362334) (← links)
- A tight relationship between generic oracles and type-2 complexity theory (Q1369098) (← links)
- Gap-languages and log-time complexity classes (Q1389651) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Structural properties of bounded relations with an application to NP optimization problems (Q1589424) (← links)
- Uniformly hard languages. (Q1874273) (← links)
- Type-two polynomial-time and restricted lookahead (Q1989320) (← links)
- Quantitative coding and complexity theory of compact metric spaces (Q2106606) (← links)
- Parametrised second-order complexity theory with applications to the study of interval computation (Q2285136) (← links)
- Game semantics approach to higher-order complexity (Q2396718) (← links)
- Feasible functionals and intersection of ramified types (Q2842842) (← links)
- Axiomatizing Resource Bounds for Measure (Q3091445) (← links)
- Feasible Iteration of Feasible Learning Functionals (Q3520048) (← links)
- Building Mathematics-Based Software Systems to Advance Science and Create Knowledge (Q3644710) (← links)
- Structural properties for feasibly computable classes of type two (Q4009811) (← links)
- Exact Pairs for Abstract Bounded Reducibilities (Q4264535) (← links)
- (Q4989411) (← links)
- Primitive recursive equivalence relations and their primitive recursive complexity (Q5061388) (← links)
- (Q5094117) (← links)
- The theory of the polynomial many-one degrees of recursive sets is undecidable (Q5096783) (← links)
- Polynomial Running Times for Polynomial-Time Oracle Machines (Q5111319) (← links)
- (Q5155667) (← links)
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY (Q5858921) (← links)
- Quantitative continuity and Computable Analysis in Coq (Q5875440) (← links)
- Computation models and function algebras (Q6064278) (← links)
- Expressing computational complexity in constructive type theory (Q6064279) (← links)
- Complete and tractable machine-independent characterizations of second-order polytime (Q6181938) (← links)