The inversion problem for computable linear operators
From MaRDI portal
Recommendations
Cited in
(10)- A computable version of Banach's inverse mapping theorem
- On the Inversion Complexity of a System of Functions
- Computing Inverse ST in Linear Complexity
- Computability of solutions of operator equations
- On computable compact operators on Banach spaces
- Stashing and parallelization pentagons
- All superlinear inverse schemes are coNP-hard
- Theory and Applications of Models of Computation
- Towards computability of elliptic boundary value problems in variational formulation
- Borel complexity and computability of the Hahn-Banach theorem
This page was built for publication: The inversion problem for computable linear operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418667)