Pages that link to "Item:Q3677053"
From MaRDI portal
The following pages link to Complexity of Solving Linear Systems in Different Models of Computation (Q3677053):
Displayed 8 items.
- Information-based complexity: New questions for mathematicians (Q751814) (← links)
- Some complexity results in parallel matrix-based signal processing (Q915456) (← links)
- A new convex objective function for the supervised learning of single-layer neural networks (Q962791) (← links)
- Matrix inversion in RNC\(^ 1\) (Q1179457) (← links)
- Fast and efficient parallel solution of dense linear systems (Q1825589) (← links)
- ν☆: a robot path planning algorithm based on renormalised measure of probabilistic regular languages (Q3632925) (← links)
- Perspectives on information-based complexity (Q3992024) (← links)
- Parallel algorithm for householder transformation with applications to Ill-conditioned problems (Q4347175) (← links)