Matrix multiplication via arithmetic progressions
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On fast multiplication of polynomials over arbitrary algebras
Acta Informatica
Lazy multiplication of formal power series
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Fast Algorithms for Manipulating Formal Power Series
Journal of the ACM (JACM)
Variations on computing reciprocals of power series
Information Processing Letters - Special issue analytical theory of fuzzy control with applications
Approximate algorithms to derive exact solutions to systems of linear equations
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Journal of Symbolic Computation
The truncated fourier transform and applications
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
The Middle Product Algorithm I
Applicable Algebra in Engineering, Communication and Computing
New algorithms for relaxed multiplication
Journal of Symbolic Computation
Fast computation of power series solutions of systems of differential equations
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Fast modular transforms via division
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Polynomial evaluation and interpolation on special sets of points
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Journal of Computer and System Sciences
Acceleration of the inversion of triangular Toeplitz matrices and polynomial division
CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
Homotopy techniques for multiplication modulo triangular sets
Journal of Symbolic Computation
On the bit-complexity of sparse polynomial and series multiplication
Journal of Symbolic Computation
On the complexity of multivariate blockwise polynomial multiplication
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Structured FFT and TFT: symmetric and lattice polynomials
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
| Hi-index | 0.00 |
Let C[[z]] be the ring of power series over an effective ring C. In Brent and Kung (1978), it was first shown that differential equations over C[[z]] may be solved in an asymptotically efficient way using Newton's method. More precisely, if M(n) denotes the complexity for multiplying two polynomials of degree