An algorithm for deciding zero equivalence of nested polynomially recurrent sequences
Work
Year: 2007
Type: article
Source: ACM Transactions on Algorithms
Author Manuel Kauers
Institution Johannes Kepler University of Linz
Cites: 23
Cited by: 6
Related to: 10
FWCI: 0.606
Citation percentile (by year/subfield): 48.59
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed