An adaptive hybrid algorithm for multiplying dense polynomials
Part of the Lecture Notes in Computer Science book series (LNCS, volume 144)
1. Algorithms I
KeywordsHybrid Algorithm Polynomial Multiplication Variate Algorithm Univariate Algorithm Multivariate Problem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- Bonneau, R.J., Fast Polynomial Operations Using the Fast Fourier Transform, Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge, 1974 (unpublished).Google Scholar
- Moenck, R.T., "Practical Fast Polynomial Multiplication," in Proc. 1976 ACM Symposium on Symbolic and Algebraic Computation, New York, 1976, pp. 136–148.Google Scholar
- 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.Google Scholar
- Winograd, S., "On Computing the Discrete Fourier Transform," Mathematics of Computation, Vol. 32, No. 141, Jan. 1978, pp.175–199.Google Scholar
- Winograd, S., Arithmetic Complexity of Computations, Philadelphia, 1980.Google Scholar
- 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.Google Scholar
© Springer-Verlag Berlin Heidelberg 1982