Multiplicative complexity of polynomial multiplication over finite fields
暂无分享,去创建一个
[1] Abraham Lempel,et al. On the Complexity of Multiplication in Finite Fields , 1983, Theor. Comput. Sci..
[2] John E. Hopcroft,et al. Duality applied to the complexity of matrix multiplications and other bilinear forms , 1973, STOC '73.
[3] Joseph Ja' Ja'. Computations of Bilinear Forms over Finite Fields , 1980 .
[4] S. Winograd,et al. A new approach to error-correcting codes , 1977, IEEE Trans. Inf. Theory.
[5] S. Winograd. On the number of multiplications necessary to compute certain functions , 1970 .
[6] Michael Kaminski. A Lower Bound for Polynomial Multiplication , 1985, Theor. Comput. Sci..
[7] H BshoutyNader,et al. Multiplicative complexity of polynomial multiplication over finite fields , 1989 .
[8] David P. Dobkin,et al. An Improved Lower Bound on Polynomial Multiplication , 1980, IEEE Transactions on Computers.
[9] K. Ramachandra,et al. Vermeidung von Divisionen. , 1973 .
[10] John E. Hopcroft,et al. Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms , 1973, SIAM J. Comput..
[11] Yechezkel Zalcstein,et al. Algebras Having Linear Multiplicative Complexities , 1977, JACM.
[12] Rudolf Lide,et al. Finite fields , 1983 .
[13] Nader H. Bshouty,et al. Multiplicative complexity of polynomial multiplication over finite fields (Extended abstract) , 1987, FOCS.
[14] David P. Dobkin,et al. On the optimal evaluation of a set of bilinear forms , 1973, SWAT.
[15] W. W. Peterson,et al. Error-Correcting Codes. , 1962 .
[16] Journal of the Association for Computing Machinery , 1961, Nature.
[17] R. Tennant. Algebra , 1941, Nature.
[18] Joseph JáJá. Optimal Evaluation of Pairs of Bilinear Forms , 1979, SIAM J. Comput..
[19] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .