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
DOI: 10.1016/j.jsc.2005.05.004
摘要 查看摘要
Journal of symbolic computation. 2005;40(3):1076-1086. doi: 10.1016/j.jsc.2005.05.004 Q21.12025
DOI: 10.1016/j.jsc.2005.05.004
摘要 查看摘要