A lower bound on the complexity of polynomial multiplication over finite fields

SIAM Journal on Computing

Volumn 34, Issue 4, 2005, Pages 960-992

  Kaminski, Michael ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Error correcting codes; Hankel matrices; Linear recurring sequences; Polynomial multiplication; Quadratic algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY;

ERROR-CORRECTING CODES; HANKEL MATRICES; LINEAR RECURRING SEQUENCES; POLYNOMIAL MULTIPLICATION; QUADRATIC ALGORITHMS;

POLYNOMIALS;

EID: 24344462671     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704442118     Document Type: Article

References (23)

1. A. AVERBUCH, N. H. BSHOUTY, AND M. KAMINSKI, A classification of quadratic algorithms for multiplying polynomials of small degree over finite fields, J. Algorithms, 13 (1992), pp. 577-588.
2. R. W. BROCKETT AND D.P. DOBKIN, On the optimal evaluation of a set of bilinear forms, Linear Algebra Appl., 19 (1978), pp. 207-235.
3. M. R. BROWN AND D. P. DOBKIN, An improved lower bound on polynomial multiplication, IEEE Trans. Comput., 29 (1980), pp. 337-340.
4. N. H. BSHOUTY, A lower bound for the multiplication of polynomials modulo a polynomial, Inform. Process. Lett., 41 (1992), pp. 321-326.
5. N. H. BSHOUTY AND M. KAMINSKI, Multiplication of polynomials over finite fields, SIAM J. Comput., 19 (1990), pp. 452-456.
6. P. BÜRGISSER, M. CLAUSEN, AND A. SHOKROLLAHI, Algebraic Complexity Theory, Springer, Berlin, 1997.
7. D. V. CHUDNOVSKY AND G. V. CHUDNOVSKY, Algebraic complexities and algebraic curves over finite fields, J. Complexity, 4 (1988), pp. 285-316.
8. E. FEIG, On systems of bilinear forms whose minimal division-free algorithms are all bilinear, J. Algorithms, 2 (1981), pp. 261-281.
9. E. FEIG, Certain systems of bilinear forms whose minimal algorithms are all quadratic, J. Algorithms, 4 (1983), pp. 137-149.
10. C. M. FIDUCCIA AND Y. ZALCSTEIN, Algebras having linear multiplicative complexity, J. ACM, 24 (1977), pp. 311-331.
11. J. JA' JA', On the complexity of bilinear forms with commutativity, SIAM J. Comput., 9 (1980), pp. 713-728.
12. J. JA' JA', Optimal evaluation of pairs of bilinear forms, SIAM J. Comput., 8 (1979), pp. 443-462.
13. J. JA' JA', Computation of bilinear forms over finite fields, J. ACM, 27 (1980), pp. 822-830.
14. M. KAMINSKI, A lower bound for polynomial multiplication, Theoret. Comput. Sci., 40 (1985), pp. 319-322.
15. M. KAMINSKI AND N. H. BSHOUTY, Multiplicative complexity of polynomial multiplication over finite fields, J. ACM, 36 (1989), pp. 150-170.
16. A. LEMPEL, G. SEROUSSI, AND S. WINOGRAD, On the complexity of multiplication in finite fields, Theoret. Comput. Sci., 22 (1983), pp. 285-296.
17. A. LEMPEL AND S. WINOGRAD, A new approach to error-correcting codes, IEEE Trans. Inform. Theory, 23 (1977), pp. 503-508.
18. R. LIDL AND H. NIEDERREITER, Finite Fields, Encyclopedia Math. Appl. 20, G.-C. Rota, ed., Addison-Wesley, Reading, MA, 1983.
19. W. W. PETERSON AND E. WELDON, Error-Correcting Codes, MIT Press, Cambridge, MA, 1972.
20. I. E. SHPARLINSKI, M. A. TSFASMAN, AND S. G. VLADUT, Curves with many points and multiplication in finite fields, in Coding Theory and Algebraic Geometry, Lecture Notes in Math. 1518, H. Stichtenoth and M. A. Tsfasman, eds., Springer, Berlin, 1992, pp. 145-169.
21. V. STRASSEN, Vermeidung von divisionen, J. Reine Angew. Math., 264 (1973), pp. 184-202.
22. S. WINOGRAD, On the number of multiplications necessary to compute certain functions, Comm. Pure Appl. Math., 23 (1970), pp. 165-179.
23. S. WINOGRAD, Some bilinear forms whose multiplicative complexity depends on the field constants, Math. Systems Theory, 10 (1976/77), pp. 169-180.