Computability in linear algebra
From MaRDI portal
Recommendations
- Publication:4472015
- Complexity of Solving Linear Systems in Different Models of Computation
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- A tutorial on computable analysis
- Real computation with least discrete advice: a complexity theory of nonuniform computability
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3720907 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 3533576 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 1142308 (Why is no real title available?)
- scientific article; zbMATH DE number 2079882 (Why is no real title available?)
- scientific article; zbMATH DE number 1499089 (Why is no real title available?)
- scientific article; zbMATH DE number 1746051 (Why is no real title available?)
- scientific article; zbMATH DE number 3349776 (Why is no real title available?)
- Analytic machines
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- Geometric algorithms and combinatorial optimization.
- Modern computer algebra
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
- On computations with integer division
- On the definitions of computable real continuous functions
Cited in
(28)- On the complexity of robust eventual inequality testing for C-finite functions
- Real computation with least discrete advice: a complexity theory of nonuniform computability
- Relative computability and uniform continuity of relations
- scientific article; zbMATH DE number 2079882 (Why is no real title available?)
- scientific article; zbMATH DE number 1746051 (Why is no real title available?)
- Computability of the Spectrum of Self-Adjoint Operators and the Computable Operational Calculus
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- Computational Complexity and Numerical Stability of Linear Problems
- Computer Science for Continuous Data
- Computability, noncomputability, and hyperbolic systems
- scientific article; zbMATH DE number 2072707 (Why is no real title available?)
- Computability and the Implicit Function Theorem
- Computing the exact number of periodic orbits for planar flows
- Effectively open real functions
- Computing finite-dimensional realizations
- Calculating proofs on a computer in studies of the properties of linear mappings in finite-dimensional spaces
- Computability of the Solutions to Navier-Stokes Equations via Effective Approximation
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
- Computational complexity of classical solutions of partial differential equations
- On envelopes and backward approximations
- Computability of the metric projection onto finite-dimensional linear subspaces
- Interval Linear Algebra and Computational Complexity
- Dividing by zero -- how bad is it, really?
- scientific article; zbMATH DE number 7407788 (Why is no real title available?)
- Computability Models: Algebraic, Topological and Geometric Algorithms
- Beta-shifts, their languages, and computability
- Computability of finite-dimensional linear subspaces and best approximation
- Computing conformal maps of finitely connected domains onto canonical slit domains
This page was built for publication: Computability in linear algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703545)
