A new Characterization of Type-2 Feasibility
From MaRDI portal
Recommendations
Cited in
(42)- A foundational delineation of poly-time
- Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals
- A tight relationship between generic oracles and type-2 complexity theory
- Theories with self-application and computational complexity.
- Feasible computability and resource bounded topology
- Quantitative coding and complexity theory of compact metric spaces
- Parametrised second-order complexity theory with applications to the study of interval computation
- Characterizing polynomial time complexity of stream programs using interpretations
- Game semantics approach to higher-order complexity
- Feasible functionals and intersection of ramified types
- Time polynomial in input or output
- Axiomatizing resource bounds for measure
- Safe Weak Minimization Revisited
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
- Feasible Iteration of Feasible Learning Functionals
- Elementary explicit types and polynomial time operations
- scientific article; zbMATH DE number 66471 (Why is no real title available?)
- scientific article; zbMATH DE number 176202 (Why is no real title available?)
- scientific article; zbMATH DE number 1223632 (Why is no real title available?)
- A Relationship between Equilogical Spaces and Type Two Effectivity
- scientific article; zbMATH DE number 806755 (Why is no real title available?)
- Computable analysis and notions of continuity in \textsc{Coq}
- Representations and evaluation strategies for feasibly approximable functions
- On the versatility of open logical relations. Continuity, automatic differentiation, and a containment theorem
- A tier-based typed programming language characterizing feasible functionals
- Polynomial Running Times for Polynomial-Time Oracle Machines
- Some applications of logic to feasibility in higher types
- Quantitative continuity and Computable Analysis in Coq
- Type 2 polynomial hierarchies
- Semantics, specification logic, and Hoare logic of exact real computation
- On basic feasible functionals and the interpretation method
- Second-order parameterizations for the complexity theory of integrable functions
- Quantitative coding and complexity theory of \textit{continuous} data. I: Motivation, definition, consequences
- A characterization of basic feasible functionals through higher-order rewriting and tuple interpretations
- Declassification policy for program complexity analysis
- A proof-theoretic characterization of the basic feasible functionals
- Resource restricted computability theoretic learning: Illustrative topics and problems
- Two algorithms in search of a type-system
- Speed-up theorems in type-2 computations using oracle Turing machines
- Exact real computation of solution operators for linear analytic systems of partial differential equations
- The basic feasible functionals in computable analysis
- Complexity for type-2 relations
This page was built for publication: A new Characterization of Type-2 Feasibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875448)
