Predicting zero coefficients in formal power series computations.

DOI10.1006/jsco.2000.0495zbMath1045.13009OpenAlexW2156479797MaRDI QIDQ1599549

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) Computational aspects and applications of commutative rings (13P99) Formal power series rings (13F25)

Cites Work

• On the computational power of pushdown automata
• A Fast Monte-Carlo Test for Primality
• Fast Algorithms for Manipulating Formal Power Series
• Inverting Polynomials and Formal Power Series
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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