Fast Computation With Two Algebraic Numbers
msra(2003)
摘要
We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special resultants, that we compute using power sums of roots of polynomials, by means of their generating series.
更多查看译文
关键词
resultant
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络