首页 正文

Journal of symbolic computation. 2002;33(5):701-733. doi: 10.1006/jsco.2002.0531 Q21.12025

Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding

Victor Y. Pan

DOI: 10.1006/jsco.2002.0531

摘要 查看摘要

Copyright © . 中文内容为AI机器翻译,仅供参考!

期刊名:Journal of symbolic computation

缩写:J SYMB COMPUT

ISSN:0747-7171

e-ISSN:1095-855X

IF/分区:1.1/Q2

文章目录 更多期刊信息

全文链接
引文链接
复制
已复制!
推荐内容
Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding