Predicting zero coefficients in formal power series computations.

DOI10.1006/JSCO.2000.0495MaRDI QIDQ1599549zbMATH OpenOpenAlexFDO

Authors R. Smith

Publication date 11 June 2002

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/122b392bf643e6c2cb34a990bdc5d853636f3afa

zbMATH Keywords

randomized algorithmslong sequences of zero coefficients in a power series

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Formal power series rings (13F25) Computational aspects and applications of commutative rings (13P99)

Recommendations

• scientific article; zbMATH DE number 2151225
• Relax, but don't be too lazy
• Series prediction based on algebraic approximants
• Inverting Polynomials and Formal Power Series
• A fast numerical algorithm for the composition of power series with complex coefficients

Cites work

• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 108109 (Why is no real title available?)
• scientific article; zbMATH DE number 3597592 (Why is no real title available?)
• scientific article; zbMATH DE number 481965 (Why is no real title available?)
• scientific article; zbMATH DE number 621810 (Why is no real title available?)
• scientific article; zbMATH DE number 691245 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A Fast Monte-Carlo Test for Primality
• Fast Algorithms for Manipulating Formal Power Series
• Inverting Polynomials and Formal Power Series
• On the computational power of pushdown automata

This page was built for publication: Predicting zero coefficients in formal power series computations.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1599549)