Faster relaxed multiplication

DOI10.1145/2608628.2608657zbMath1325.68305MaRDI QIDQ3452421

Joris van der Hoeven

Publication date: 11 November 2015

Published in: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2608628.2608657

zbMATH Keywords

complexity; FFT; power series; computer algebra; multiplication; online algorithm; fundamental algorithms

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W30: Symbolic computation and algebraic computation

65T50: Numerical methods for discrete and fast Fourier transforms

13F25: Formal power series rings

68W27: Online algorithms; streaming algorithms

Related Items

Fast integer multiplication using generalized Fermat primes, Unnamed Item, Relaxed Hensel lifting of triangular sets, A simple and fast online power series multiplication and its analysis, Computing with D-algebraic power series, On the complexity and parallel implementation of Hensel's lemma and Weierstrass preparation, From implicit to recursive equations, On existence and uniqueness of formal power series solutions of algebraic ordinary differential equations, Fast amortized multi-point evaluation, Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals, Integer multiplication in time \(O(n\log n)\)

Uses Software

• Jordan

Cites Work

• Unnamed Item
• Unnamed Item
• An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
• Cylindrical algebraic decomposition using validated numerics
• The Jordan Curve Theorem, Formally and Informally
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Definability and decision problems in arithmetic