The following pages link to (Q5090373):
Displaying 8 items.
- Upper bounds on the complexity of solving systems of linear equations (Q1057647) (← links)
- A queueing network-based distributed Laplacian solver (Q1979459) (← links)
- Analysis of the binary complexity of asymptotically fast algorithms for linear system solving (Q3806671) (← links)
- Approximating Matrix Eigenvalues by Subspace Iteration with Repeated Random Sparsification (Q5038410) (← links)
- Solving Linear Programs in the Current Matrix Multiplication Time (Q5056400) (← links)
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving (Q5885581) (← links)
- Sublinear P system solutions to NP-complete problems (Q6038691) (← links)
- Sublinear Algorithms for Local Graph-Centrality Estimation (Q6093189) (← links)