✦ LIBER ✦

Extending the four Russians' bound to general matrix multiplication

✍ Scribed by Nicola Santoro

Book ID: 114037812
Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 149 KB
Volume: 10
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(80)90080-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The four Russians' algorithm for boolean

The four Russians' algorithm for boolean matrix multiplication is optimal in its class

✍ Angluin, Dana 📂 Article 📅 1976 🏛 Association for Computing Machinery ⚖ 169 KB

Extending Dantzig's bound to the bounded

Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem

✍ Francois Vanderbeck 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 105 KB

Plotkin bound generalization to the case

Plotkin bound generalization to the case of multiple packings

✍ V. M. Blinovsky 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 357 KB

Improved Bounds in the Multiple-Recursiv

Improved Bounds in the Multiple-Recursive Matrix Method for Pseudorandom Number and Vector Generation

✍ Harold Niederreiter 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 275 KB

The multiple-recursive matrix method is a general linear method for the generation of uniform pseudorandom numbers and vectors which was introduced and studied in earlier papers of the author. In this paper we improve on various bounds in this method by using information on -splitting subspaces of f

Generalized optical transfer-matrix tech

Generalized optical transfer-matrix technique: application to the nonlinear response of multiple quantum wells

✍ Avramenko, Vladimir G. 📂 Article 📅 2006 🏛 Optical Society of America 🌐 English ⚖ 257 KB

Application of the twinning transformati

Application of the twinning transformation matrix to derivation of the generalized reciprocal lattice with multiple diffraction

✍ Calbick, C. J. ;Marcus, R. B. 📂 Article 📅 1967 🏛 International Union of Crystallography 🌐 English ⚖ 649 KB