In this paper, we consider a special integer bottleneck problem, and present two polynomial algorithms.

研究了一个特殊的整数瓶颈问题并给出了两个求最优解的多项式算法程序。

youdao

Using the similarity between polynomial ring and integer ring the paper establishes Sunse's Theorem in the polynomial ring in number field, and offers its brief learning and practice.

利用数域上一元多项式环与整数环相似的性质，建立数域上一元多项式环中的孙子定理，并给出它的简单应用。

youdao

Furthermore, the integer programming method is exploited as the mathematical tool for the generation of a polynomial algorithm producing the optimal set elementary siphons.

在此基础上，以整数规划算法为数学工具给出了时间算法复杂度为多项式的最优基本信标的计算方法。

youdao