This work was supported in part by NSERC Grant A57.
Preview
Unable to display preview. Download preview PDF.
References
Bonneau, R.J., Fast Polynomial Operations Using the Fast Fourier Transform, Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge, 1974 (unpublished).
Fateman, R.J., "Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments," SIAM Journal on Computing, Vol.3, No.3, Sept. 1974, pp. 196–213.
Moenck, R.T., "Practical Fast Polynomial Multiplication," in Proc. 1976 ACM Symposium on Symbolic and Algebraic Computation, New York, 1976, pp. 136–148.
Moenck, R.T., Another Polynomial Homomorphism," Acta Informatica, Vol.6, 1976, pp. 153–169.
Fateman, R.J., "A Case Study in Interlanguage Communication: Fast LISP Polynomial Operations Written in ‘C'," in Proc. 1981 ACM Symposium on Symbolic and Algebraic Computation, New York, 1981, pp.122–125.
Winograd, S., "On Computing the Discrete Fourier Transform," Mathematics of Computation, Vol. 32, No. 141, Jan. 1978, pp.175–199.
Winograd, S., Arithmetic Complexity of Computations, Philadelphia, 1980.
Agarwal, R.C., and Cooley, J.W., "New Algorithms for Digital Convolution," IEEE Transactions on Acoustics, Speech, and Signal Processing, Vol. ASSP-25, No. 5, Oct. 1977, pp. 392–410.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Probst, D.K., Alagar, V.S. (1982). An adaptive hybrid algorithm for multiplying dense polynomials. In: Calmet, J. (eds) Computer Algebra. EUROCAM 1982. Lecture Notes in Computer Science, vol 144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11607-9_2
Download citation
DOI: https://doi.org/10.1007/3-540-11607-9_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11607-3
Online ISBN: 978-3-540-39433-4
eBook Packages: Springer Book Archive