The complexity of bivariate power series arithmetic

Theoretical Computer Science

Volumn 295, Issue 1-3, 2003, Pages 65-83

  Bläser, Markus ^a  

^a UNIVERSITY OF LÜBECK   (Germany)

Author keywords

Bivariate power series; Division; Multiplication; Multiplicative complexity

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS;

BIVARIATE POWER SERIES;

COMPUTER SCIENCE;

EID: 0037463546     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00396-1     Document Type: Conference Paper

References (13)

1. Alder A., Strassen V. On the algorithmic complexity of associative algebras. Theoret. Comput. Sci. 15:1981;201-211.
2. M. Bläser, Bivariate polynomial multiplication, in: Proc. 39th Annu. IEEE Symp. on Foundations of Computer Science (FOCS), 1998, pp. 186-191.
3. M. Bläser, On the number of multiplications needed to invert a monic power series over fields of characteristic two, Technical Report, Institut für Informatik II, Universität Bonn, January 2000.
4. M. Bläser, Improvements of the Alder-Strassen bound: algebras with nonzero radical, in: Proc. 28th Internat. EATCS Colloq. on Automata, Languages, and Programming (ICALP), Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin 2001, pp. 79-91.
5. Bürgisser P., Clausen M., Shokrollahi M.A. Algebraic Complexity Theory. 1997;Springer, Berlin.
6. Drozd Y.A., Kirichenko V.V. Finite Dimensional Algebras. 1994;Springer, Berlin.
7. de Groote H.F. Lectures on the Complexity of Bilinear Problems. Lecture Notes in Computer Science. Vol. 245:1986;Springer, Berlin.
8. de Groote H.F., Heintz J. Commutative algebras of minimal rank. Linear Algebra Appl. 55:1983;37-68.
9. Kalorkoti K. Inverting polynomials and formal power series. SIAM J. Comput. 22:1993;552-559.
10. Kung H.T. On computing reciprocals of power series. Numer. Math. 22:1974;341-348.
11. Schönhage A. Bivariate polynomial multiplication patterns. Proc. 11th Applied Algebra and Error Correcting Codes Conf. (AAECC), Lecture Notes in Computer Science. Vol. 948:1995;70-81 Springer, Berlin.
12. A. Schönhage, Multiplicative complexity of Taylor shifts and a new twist of the substitution method, in: Proc. 39th Annu. IEEE Symp. on Foundations of Computer Science (FOCS), 1998, pp. 212-215.
13. Strassen V. Vermeidung von Divisionen. J. Reine Angew. Math. 264:1973;184-202.