The following pages link to Computability in linear algebra (Q703545):
Displaying 18 items.
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra (Q424551) (← links)
- Beta-shifts, their languages, and computability (Q633763) (← links)
- Computability of finite-dimensional linear subspaces and best approximation (Q638485) (← links)
- Computing conformal maps of finitely connected domains onto canonical slit domains (Q692914) (← links)
- Effectively open real functions (Q864433) (← links)
- Computability, noncomputability, and hyperbolic systems (Q2018989) (← links)
- On envelopes and backward approximations (Q2104271) (← links)
- Computational complexity of classical solutions of partial differential equations (Q2104279) (← links)
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations (Q2693688) (← links)
- Relative computability and uniform continuity of relations (Q2930869) (← links)
- Computability of the Solutions to Navier-Stokes Equations via Effective Approximation (Q3297826) (← links)
- Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces (Q4918004) (← links)
- Computability of the Spectrum of Self-Adjoint Operators and the Computable Operational Calculus (Q4918048) (← links)
- Computability and the Implicit Function Theorem (Q4921433) (← links)
- Computing the exact number of periodic orbits for planar flows (Q5100021) (← links)
- (Q5155677) (← links)
- Computability Models: Algebraic, Topological and Geometric Algorithms (Q5886546) (← links)
- On the complexity of robust eventual inequality testing for C-finite functions (Q6623018) (← links)
