加载中…
We present a generalization of a polynomial factorization algorithm that works with ideals in maximal orders of global function fields. The method presented in this paper is intrinsic in the sense that it does not depend on the embedding of the ring of polynomials into the Dedekind domain in question.

生成讲解博客的中文版本

生成AI智能校验的中文版本