叫做这个多项式的次数 degree of polynomial
内点法是一种求解线性规划问题的多项式时间算法，其显著特征是其迭代次数与系统规模关系不大。
The interior point method is a polynomial time algorithm for solving linear programming problem, and its number of iterations is independent on the size of system.
快速相关攻击的关键是寻找序列的项数较少、次数较低的生成多项式。
It is a key for the fast correlation attacks that search for generation polynomials with less terms and low degrees.
作为一种可选定次数的完备正交多项式系统，U系统所定义的矩具有标准正交性、收敛性等优良性质。
As a kind of complete orthogonal polynomial system, U system has many good properties such as orthogonality and convergence.
应用推荐