✦ LIBER ✦

A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication

✍ Scribed by Andrzej Lingas

Publisher: Springer
Year: 2010
Tongue: English
Weight: 482 KB
Volume: 61
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-010-9441-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved algorithm for Boolean matrix

An improved algorithm for Boolean matrix multiplication

✍ N. Santoro; J. Urrutia 📂 Article 📅 1986 🏛 Springer Vienna 🌐 English ⚖ 366 KB

Stability of fast algorithms for matrix

Stability of fast algorithms for matrix multiplication

✍ Dario Bini; Grazia Lotti 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 362 KB

A practical algorithm for faster matrix

A practical algorithm for faster matrix multiplication

✍ Igor Kaporin 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 69 KB

The purpose of this paper is to present an algorithm for matrix multiplication based on a formula discovered by Pan [7]. For matrices of order up to 10 000, the nearly optimum tuning of the algorithm results in a rather clear non-recursive one-or two-level structure with the operation count comparab

A very fast multiplication algorithm for

A very fast multiplication algorithm for VLSI implementation

✍ Jean Vuillemin 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 507 KB

Fast Algorithms with Preprocessing for M

Fast Algorithms with Preprocessing for Matrix-Vector Multiplication Problems

✍ I. Gohberg; V. Olshevsky 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 587 KB

Output-Sensitive Algorithm for Computing

Output-Sensitive Algorithm for Computing β-Skeletons

✍ A. Mukhopadhyay; S. V. Rao 📂 Article 📅 2000 🏛 Springer Vienna 🌐 English ⚖ 99 KB