✦ LIBER ✦

A Note on the Russian Peasant Multiplication Algorithm

✍ Scribed by William R. Spickerman

Book ID: 114974628
Publisher: School Science and Mathematics Association
Year: 1971
Tongue: English
Weight: 68 KB
Volume: 71
Category: Article
ISSN: 0036-6803
DOI: 10.1111/j.1949-8594.1971.tb13769.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on a fast algorithm for sparse ma

A note on a fast algorithm for sparse matrix multiplication

✍ Jacques Cohen 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 94 KB

A Note on Division Algorithms Based on M

A Note on Division Algorithms Based on Multiplication

✍ Shaham, Z.; Riesel, Z. 📂 Article 📅 1972 🏛 IEEE 🌐 English ⚖ 232 KB

A note on boolean matrix multiplication

✍ Jozef Vyskoč 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 187 KB

The Russian peasant and the bird: A mora

The Russian peasant and the bird: A moral keynote

✍ Richard Dougherty 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 583 KB

A Note on the Combinatorics of Multiplic

A Note on the Combinatorics of Multiplication in Groups

✍ A. Juhász; A. Leibman 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 111 KB

Let S be a finite subset of a group G, |S| = n, and let g ∈ S • S. Then g induces a partial function λ g : S → S by λ g (s) = t if and only if st = g and λ g (s) is not defined if g ∈ sS. For every g ∈ S • S, λ g is a one-to-one mapping. In this note we describe the groups which have a finite genera

NOTE ON THE PHILLIPS SYSTEM OF MULTIPLIC

NOTE ON THE PHILLIPS SYSTEM OF MULTIPLICATION

✍ W. E. Pyke 📂 Article 📅 1925 🏛 School Science and Mathematics Association 🌐 English ⚖ 95 KB