Composing power series over a finite ring in essentially linear time

Journal of Symbolic Computation

Volumn 26, Issue 3, 1998, Pages 339-341

  Bernstein, Daniel J ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032163968     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1998.0216     Document Type: Article

References (5)

1. Bernstein, D.J. (1997). Multidigit multiplication for mathematicians. Preprint, available from http://pobox.com/~djb/papers/m3.dvi.
2. Brent, R.P., Kung, H.T. (1978). Fast algorithms for manipulating formal power series. J. ACM, 25, 581-595.
3. Cantor, D.G., Kaltofen, E. (1991). On fast multiplication of polynomials over arbitrary algebras. Acta Informatica, 28, 693-701.
4. Kaltofen, E., Shoup, V. (1997) Subquadratic-time factoring of polynomials over finite fields. Preprint.
5. Knuth, D.E. (1981). The Art of Computer Programming, Volume 2: Seminumerical Algorithms, 2nd edn. Reading, MA, Addison-Wesley.