✦ LIBER ✦

On Minimizing the Number of Multiplications Necessary for Matrix Multiplication

✍ Scribed by J. E. Hopcroft and L. R. Kerr

Book ID: 124881321
Publisher: Society for Industrial and Applied Mathematics
Year: 1971
Tongue: English
Weight: 624 KB
Volume: 20
Category: Article
ISSN: 0036-1399
DOI: 10.2307/2099880

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Number of Multiplications Require

On the Number of Multiplications Required for Matrix Multiplication

✍ Brockett, Roger W.; Dobkin, David 📂 Article 📅 1976 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 427 KB

Errata: On the Number of Multiplications

Errata: On the Number of Multiplications Required for Matrix Multiplication

✍ Brockett, R. W.; Dobkin, D. 📂 Article 📅 1978 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 34 KB

On the Number of Nonscalar Multiplicatio

On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials

✍ Paterson, Michael S.; Stockmeyer, Larry J. 📂 Article 📅 1973 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 638 KB

On the number of multiplications necessa

On the number of multiplications necessary to compute certain functions

✍ Shmuel Winograd 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 699 KB

On the number of multiplications necessa

On the number of multiplications necessary to compute a length-2nDFT

✍ Heideman, M.; Burrus, C. 📂 Article 📅 1986 🏛 IEEE ⚖ 607 KB

The Multiple-Recursive Matrix Method for

The Multiple-Recursive Matrix Method for Pseudorandom Number Generation

✍ H. Niederreiter 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 859 KB

We carry out an in-depth analysis of the multiple-recursive matrix method for uniform pseudorandom number generation which was introduced in an earlier paper of the author. This method yields much larger period lengths than the GFSR method with the same order of the recursion and the same precision.