Subject
General Computer Science,Theoretical Computer Science
Reference27 articles.
1. S. Barnett, A Bezoutian matrix for Chebyshev polynomials, in: Applications of Matrix Theory (Bradford, 1988), Vol. 22, Institute of Mathematics and its Application Conference Series New Series, Oxford University Press, 1988, Oxford, pp. 137–149.
2. Fast parallel computation of the polynomial remainder sequence via Bézout and Hankel matrices;Bini;SIAM J. Comput.,1995
3. Fast fraction-free triangularization of Bezoutians with applications to sub-resultant chain computation;Bini;Linear Algebra Appl.,1998
4. D.A. Bini, V. Pan, Matrix and Polynomial Computations: Fundamental Algorithms, Vol. 1, Birkhäuser, Boston, 1994.
5. On Euclid's algorithm and the theory of subresultants;Brown;J. Assoc. Comput. Mach.,1971
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献