✦ LIBER ✦

On the complexity of some algorithms of matrix multiplication

✍ Scribed by Valery B Alekseyev

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 712 KB
Volume: 6
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(85)90019-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The bit complexity of matrix multiplicat

The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented λ algorithms

✍ V.Y. Pan 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 869 KB

The numbers of bit operations (br) required for matrix multiplication (MM), matrix inversion (MI). the evaluation of the determinant of a matrix (Det). and the solution of a system of linear equations (SLE) are estimated from above and below. (For SLE the estimates are nearly sharp.) The bit-complex

On the Complexity of Some Problems on Gr

On the Complexity of Some Problems on Groups Input as Multiplication Tables

✍ David Mix Barrington; Peter Kadau; Klaus-Jörn Lange; Pierre McKenzie 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 131 KB

The Cayley group membership problem (CGM) is to input a groupoid (binary algebra) G given as a multiplication table, a subset X of G, and an element t of G and to determine whether t can be expressed as a product of elements of X. For general groupoids CGM is P-complete, and for associative algebras

On the space complexity of some algorith

On the space complexity of some algorithms for sequence comparison

✍ Yuval Rabani; Zvi Galil 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 670 KB

Impact of mixed-parallelism on parallel

Impact of mixed-parallelism on parallel implementations of the Strassen and Winograd matrix multiplication algorithms

✍ F. Desprez; F. Suter 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 277 KB

## Abstract In this paper we study the impact of the simultaneous exploitation of data‐ and task‐parallelism, so called mixed‐parallelism, on the Strassen and Winograd matrix multiplication algorithms. This work takes place in the context of Grid computing and, in particular, in the Client–Agent(s)

The bit-operation complexity of matrix m

The bit-operation complexity of matrix multiplication and of all pair shortest path problem

✍ V.Ya. Pan 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 623 KB

On the complexity of admissible search a

On the complexity of admissible search algorithms

✍ Alberto Martelli 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 788 KB

This paper analyzes the complexity of heuristic search algorithms, Le. algorithms which find the shortest path in a graph by using an estimate to guide the search. In particular, .algorithm A\*, due to Hart, Nilsson and Raphael, is shown to require 0(2 ~) steps, in the worst cdse, for searching a gr