首页 正文

Journal of symbolic computation. 2005;40(3):1076-1086. doi: 10.1016/j.jsc.2005.05.004 Q21.12025

Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials

J. Gago-Vargas; M.I. Hartillo-Hermoso; J.M. Ucha-Enríquez

DOI: 10.1016/j.jsc.2005.05.004

摘要 查看摘要

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

期刊名:Journal of symbolic computation

缩写:J SYMB COMPUT

ISSN:0747-7171

e-ISSN:1095-855X

IF/分区:1.1/Q2

文章目录 更多期刊信息

全文链接
引文链接
复制
已复制!
推荐内容
Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials