scientific article; zbMATH DE number 17564
From MaRDI portal
Publication:3974889
Recommendations
Cited in
(16)- scientific article; zbMATH DE number 5519284 (Why is no real title available?)
- Small complexity classes for computable analysis
- On Computational Constructions in Function Spaces
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- Computability on computable metric spaces
- Type‐2 computability on spaces of integrable functions
- A simple and powerful approach for studying constructivity, computability, and complexity
- Proceedings of the 6th workshop on computability and complexity in analysis (CCA 2004), Lutherstadt Wittenberg, Germany, August 16--20, 2004
- Complexity theory for operators in analysis
- scientific article; zbMATH DE number 3931010 (Why is no real title available?)
- Notes on computable analysis
- Constructive mathematics: a foundation for computable analysis
- scientific article; zbMATH DE number 551031 (Why is no real title available?)
- On the complexity of the differential-algebraic description of analytic complexity classes
- Weihrauch Complexity in Computable Analysis
- Complexity theory for operators in analysis
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3974889)