Complexity of Solving Linear Systems in Different Models of Computation
From MaRDI portal
(Redirected from Publication:3677053)
Recommendations
- scientific article; zbMATH DE number 4215257
- On the computational complexity of the solution of linear systems with moduli
- scientific article; zbMATH DE number 1163749
- Upper bounds on the complexity of solving systems of linear equations
- The computational complexity of some problems of linear algebra
- The true complexity of a system of linear equations
- Computational complexity of solving equation systems
- Computational Complexity and Numerical Stability of Linear Problems
- Linear complexity parallel algorithms for linear systems of equations with recursive structure
- scientific article; zbMATH DE number 4076454
Cited in
(13)- Perspectives on information-based complexity
- Upper bounds on the complexity of solving systems of linear equations
- scientific article; zbMATH DE number 3581612 (Why is no real title available?)
- Computability in linear algebra
- ν☆: a robot path planning algorithm based on renormalised measure of probabilistic regular languages
- Fast and efficient parallel solution of dense linear systems
- Analysis of the binary complexity of asymptotically fast algorithms for linear system solving
- A new convex objective function for the supervised learning of single-layer neural networks
- Information-based complexity: New questions for mathematicians
- Matrix inversion in RNC\(^ 1\)
- Some complexity results in parallel matrix-based signal processing
- A verifiable multi-secret sharing scheme based on LCD quadratic residue codes
- Parallel algorithm for householder transformation with applications to Ill-conditioned problems
This page was built for publication: Complexity of Solving Linear Systems in Different Models of Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3677053)
