Journal of symbolic computation. 2001;31(1-2):19-36. doi: 10.1006/jsco.1999.1001 Q21.12025

On the Deterministic Complexity of Factoring Polynomials

DOI: 10.1006/jsco.1999.1001

摘要 查看摘要

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