Theory of higher order interpretations and application to basic feasible functions
From MaRDI portal
Recommendations
Cites work
- A lattice-theoretical fixpoint theorem and its applications
- Characterizing polynomial time complexity of stream programs using interpretations
- Complexity theory for operators in analysis
- Handbook of metric fixed point theory
- Higher order interpretation for higher order complexity
- Higher-order interpretations and program complexity
- Higher-order interpretations and program complexity
- scientific article; zbMATH DE number 439891 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 3480091 (Why is no real title available?)
- scientific article; zbMATH DE number 3566168 (Why is no real title available?)
- On characterizations of the basic feasible functionals. I
- Quasi-interpretations. A way to control resources
Cited in
(8)- Real or natural number interpretation and their effect on complexity
- Higher-order interpretations and program complexity
- Higher-order interpretations and program complexity
- Complete and tractable machine-independent characterizations of second-order polytime
- On basic feasible functionals and the interpretation method
- A characterization of basic feasible functionals through higher-order rewriting and tuple interpretations
- Declassification policy for program complexity analysis
- Complete and tractable machine-independent characterizations of second-order polytime
This page was built for publication: Theory of higher order interpretations and application to basic feasible functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5141617)
