Author:
Chen Jingbang,Gao Yu,Huang Yufan,Peng Richard,Wang Runze
Publisher
Springer Nature Switzerland
Reference33 articles.
1. Alon, N., Yuster, R.: Solving linear systems through nested dissection. In: FOCS 2010, pp. 225–234. IEEE Computer Society (2010). https://doi.org/10.1109/FOCS.2010.28
2. Chen, J., Gao, Y., Huang, Y., Peng, R., Wang, R.: Hardness of graph-structured algebraic and symbolic problems (2022). https://arxiv.org/abs/2109.12736v3
3. Cheung, H.Y., Lau, L.C., Leung, K.M.: Graph connectivities, network coding, and expander graphs. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 190–199. IEEE (2011)
4. Cohen, M.B., et al.: Solving directed Laplacian systems in nearly-linear time through sparse LU factorizations. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 898–909. IEEE (2018)
5. Daitch, S.I., Spielman, D.A.: Support-graph preconditioners for 2-dimensional trusses. CoRR abs/cs/0703119 (2007). http://arxiv.org/abs/cs/0703119