✦ LIBER ✦

On the Bounds of the Bilinear Complexity of Multiplication in Some Finite Fields

✍ Scribed by Stéphane Ballet; Jean Chaumine

Publisher: Springer
Year: 2004
Tongue: English
Weight: 123 KB
Volume: 15
Category: Article
ISSN: 0938-1279
DOI: 10.1007/s00200-004-0155-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some bilinear forms whose multiplicative

Some bilinear forms whose multiplicative complexity depends on the field of constants

✍ S. Winograd 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 598 KB

Multiplicative complexity of bilinear al

Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields

✍ Salvatore D. Morgera 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 877 KB

Lower bounds for the bilinear complexity

Lower bounds for the bilinear complexity of associative algebras

✍ M. Bläser 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 395 KB

On the complexity of some algorithms of

On the complexity of some algorithms of matrix multiplication

✍ Valery B Alekseyev 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 712 KB

Lower bounds for the multiplicative comp

Lower bounds for the multiplicative complexity of matrix multiplication

✍ M. Bläser 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 247 KB

On the Complexity of Some Problems on Gr

On the Complexity of Some Problems on Groups Input as Multiplication Tables

✍ David Mix Barrington; Peter Kadau; Klaus-Jörn Lange; Pierre McKenzie 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 131 KB

The Cayley group membership problem (CGM) is to input a groupoid (binary algebra) G given as a multiplication table, a subset X of G, and an element t of G and to determine whether t can be expressed as a product of elements of X. For general groupoids CGM is P-complete, and for associative algebras