Polynomial modulo reduction algorithms are one of the fundamental issues of computer algebra, and widely used in coding algorithms and cryptographic system design.
多项式模归约算法是计算机代数中的基本问题之一，在编码算法和密码体制设计中有着广泛应用。
Accordingly, this paper offered optimized algorithm for reduction of knowledge, of which time complexity was polynomial.
在此基础上提出了优化的知识约简算法，该算法的时间复杂度是多项式的。
应用推荐