Pages that link to "Item:Q1057647"
From MaRDI portal
The following pages link to Upper bounds on the complexity of solving systems of linear equations (Q1057647):
Displaying 9 items.
- Upper and lower bounds for Grigoriev's algorithm for solving integral tropical linear systems (Q376127) (← links)
- Approximating maximum satisfiable subsystems of linear equations of bounded width (Q963367) (← links)
- Rapid parallel computation of degrees in a quotient ring of polynomials over a finite field (Q1111375) (← links)
- A decision procedure for linear ``big O'' equations (Q2642465) (← links)
- Complexity of Solving Linear Systems in Different Models of Computation (Q3677053) (← links)
- Lower bounds for solving linear diophantine equations on random access machines (Q3771611) (← links)
- Analysis of the binary complexity of asymptotically fast algorithms for linear system solving (Q3806671) (← links)
- (Q4761611) (← links)
- On the complexity of solving generic overdetermined bilinear systems (Q6163795) (← links)