✦ LIBER ✦

An improved algorithm for Boolean matrix multiplication

✍ Scribed by N. Santoro; J. Urrutia

Publisher: Springer Vienna
Year: 1986
Tongue: English
Weight: 366 KB
Volume: 36
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02240211

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved time and space bounds for Boole

Improved time and space bounds for Boolean matrix multiplication

✍ Leonard Adleman; Kellogg S. Booth; Franco P. Preparata; Walter L. Ruzzo 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 English ⚖ 534 KB

A Fast Output-Sensitive Algorithm for Bo

A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication

✍ Andrzej Lingas 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 482 KB

Witnesses for Boolean Matrix Multiplicat

Witnesses for Boolean Matrix Multiplication and for Transitive Closure

✍ Zvi Galil; Olded Margalit 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 701 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

An algorithm for minimizing Boolean func

An algorithm for minimizing Boolean functions

✍ J. C. Wilson 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 581 KB

An efficient algorithm for parallel inte

An efficient algorithm for parallel integer multiplication

✍ Benjamin Singer; George Saon 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 67 KB

In this paper we propose an efficient algorithm to implement parallel integer multiplication by a combination of parallel additions, shifts and reads from a memoryresident lookup table dedicated to squares. Such an operator called PIM (parallel integer multiplication) is in fact microprogrammed at t