𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Shortest-path problem is not harder than matrix multiplication

✍ Scribed by Francesco Romani

Book ID
113162253
Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
355 KB
Volume
11
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Generalized matrix inversion is not hard
Generalized matrix inversion is not harder than matrix multiplication
✍ Marko D. PetkoviΔ‡; Predrag S. StanimiroviΔ‡ πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 668 KB

Starting from the Strassen method for rapid matrix multiplication and inversion as well as from the recursive Cholesky factorization algorithm, we introduced a completely block recursive algorithm for generalized Cholesky factorization of a given symmetric, positive semi-definite matrix A ∈ R nΓ—n .