Author:
Linial N.,Lovász L.,Wigderson A.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference15 articles.
1. A. V.Aho J. E.Hopcropt and J. D.Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, 1975.
2. S. Berkowitz, On computing the determinant in small parallel time using a small number of processors,Inform. Proc. Let.,18 (1984), 147–150.
3. G.Birkhoff and S.MacLane,A Survey of Modern Algebra, MacMillan, 1970.
4. D.Coppersmith and S.Winograd, On the asymptotic complexity of matrix multiplication,SIAM J. Computing, (1982), 472–492.
5. R. Connelly, Rigidity and Energy,Invent. Math.,66 (1982), 11–33.
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Maximum likelihood thresholds via graph rigidity;The Annals of Applied Probability;2024-06-01
2. Connections between graphs and matrix spaces;Israel Journal of Mathematics;2023-09
3. Finding a Small Vertex Cut on Distributed Networks;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. Tight Conditional Lower Bounds for Vertex Connectivity Problems;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity;ACM Journal of Experimental Algorithmics;2022-12-13