Subject
Applied Mathematics,General Engineering,Algebra and Number Theory,Theoretical Computer Science
Reference35 articles.
1. Algebraic Coding Theory;Berlekamp,1968
2. Fast solution of Toeplitz systems of equations and computation of Padé approximations;Brent;J. Algorithms,1980
3. A deterministic algorithm for sparse multivariate polynomial interpolation;Ben-Or,1988
4. D. Bini, and, V. Y. Pan, Polynomial and Matrix Computations. Volume, 1, Fundamental Algorithms, Birkhäuser, Boston, Cambridge, MA, 1994.
5. Multiple-precision zero-finding methods and the complexity of elementary function evaluation;Brent,1975
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algebraic diagonals and walks: Algorithms, bounds, complexity;Journal of Symbolic Computation;2017-11
2. Deterministic root finding over finite fields using Graeffe transforms;Applicable Algebra in Engineering, Communication and Computing;2015-12-12
3. Algebraic Diagonals and Walks;Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation;2015-06-24
4. Nearly Optimal Universal Polynomial Factorization and Root-Finding;Studies in Computational Mathematics;2013
5. The Berlekamp-Massey Algorithm revisited;Applicable Algebra in Engineering, Communication and Computing;2006-03-09