On the complexity of multiplication in finite fields
- 28 February 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 22 (3), 285-296
- https://doi.org/10.1016/0304-3975(83)90108-1
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On multiplication in algebraic extension fieldsTheoretical Computer Science, 1979
- A new approach to error-correcting codesIEEE Transactions on Information Theory, 1977
- Algebras Having Linear Multiplicative ComplexitiesJournal of the ACM, 1977
- Some bilinear forms whose multiplicative complexity depends on the field of constantsTheory of Computing Systems, 1976
- On the number of multiplications necessary to compute certain functionsCommunications on Pure and Applied Mathematics, 1970