1) polynomial transformation
多项式转化
1.
On analysis of polynomial transformation of DH secrete key and bit security;
关于DH密钥的多项式转化与比特安全性分析
2) annihilation polynomial
零化多项式
1.
The paper has defined the concept of the minimal annihilation polynomial d A,α (x) of a vector α under a matrix A, and has denoted the generating subspace by the vectors α,Aα,A 2α,…,A n-1 α by L A(α).
给出了Ｃｎ中向量α在矩阵Ａ下的最小零化多项式ｄＡ，α（ｘ）的定义，并记ＬＡ（α）为由α，Ａα，Ａ２α，…生成的Ｃｎ的子空间，得到了如下结果：１。
3) annihilating polynomial
化零多项式
1.
The concept is introduced of the annihilating polynomial and minimal polynomial of vector with linear transform, their property discussed.
介绍了线性变换作用向量的化零多项式与最小多项式的概念,并讨论了它们的性质。
2.
For a given square matrix,we confine the applications of annihilating polynomial on diagnoalization of matrix and inversion of matrix polynomial.
对给定的方阵,探讨其化零多项式的如下应用:辅助判断方阵可否对角化,当其可对角化时,给出相应对角阵的结构;判断方阵任意多项式的可逆性,当其可逆时,给出求逆矩阵的统一方法。
4) polynomial reduce
多项式约化
1.
A new method of finding key path is given, via Grbner basis and polynomial reduce, which is simple, efficient and can be easily realized by computer.
应用Gr bner基及多项式约化 ,去求关键路径的一种新方法 。
5) polynomial mollifier
多项式软化子
1.
Some properties of polynomial mollifier are presented and the conclusion that polynomial can consistently approximate continuous function is proved.
给出多项式软化子的几个性质 ,并由此证得用多项式一致逼近连续函数的结
6) linearized polynomials
线性化多项式
1.
In this paper,by analyzing the linearized polynomials,we obtain that rank distance q- cyclic codes are e- quivalent to maximum rank distance codes.
论文通过对线性化多项式的分析,得到了秩距离q-循环码等价于最大秩距离码。
补充资料：多项式乘多项式法则
Image:1173836820929048.jpg
多项式乘多项式法则
先用一个多项式的每一项乘以另一个多项式的每一项，再把所得的积相加。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。