基本释义:

不可分多项式

网络释义

1)inseparable polynomial,不可分多项式

2)separable polynomial,可分多项式

3)Irreducible polynomial,不可约多项式

4)unreliable polynomial,不可靠多项式

5)basic irreducible polynomial,基本不可约多项式

6)irreducible polynomial over (Z_n[x]),Zn[x]上的不可约多项式

用法和例句

For a wide range of integers n (n is the product of prime number and prime number or 1),a necessary and sufficient condition is given for a polynomial of degree n over the finite field F_p being an irreducible polynomial or primitive polynomial.

对于一大类整数n(n为素数乘于素数或1的积),分别给出有限域Fp上n次多项式是不可约多项式与本原多项式的一个充要条件,该条件可通过O(n3)次Fp上乘法加以验证,易于硬件实现。

In this paper, we discuss the number of irreducible polynomials over F q of degree m and period l, moreover, we describle a principle of obtaining new irreducible polynomials from known ones.

主要利用较文献 [4]更为简明的方法证明了有关有限域 Fq(q为一个素数幂 )上的以 l为周期的 n次不可约多项式的个数的结论 ,另外 ,本文结合初等数论知识得到了前面这个结论的几个推论 ,并对利用低次不可约多项式构造高次不可约多项式进行了研究 。

In this paper,the coefficient of unreliable polynomial of graphs for seven vertices were studied,the uniformly optimally reliable graph were determined,accordingly.

在建立一致最优可靠图与τ-优图之间的密切联系的基础上,对7个顶点所有图类的不可靠多项式的系数进行比较,从而确定了7个顶点所有图类一致最优可靠图的结构。

Moreover, it is proved that the polynomial x n-1, where (n,p)=1, can be uniquely factored into a product of finitely many pairwise coprime basic irreducible polynomials in Z p e .

在多项式环 Zpe[x]中 ,建立了 Hensel引理及提升 ,并利用 Hensel引理证明了 xn- 1在 Zpe[x]中可惟一分解成基本不可约多项式的乘积 ,其中 (n,p) =1。

Judgement Method of Irreducible Polynomial in Two Variables

有理数域上二元不可约多项式的判别

An Efficient and Deterministic Algorithm to Determine Irreducible and Primitive Polynomials over Finite Fields

判定有限域上不可约多项式及本原多项式的一种高效算法

Discuss The Relation Between The Period And Number Of Times Of The Irreducible Polynomial On The F_p;

F_p上不可约多项式的周期与次数的关系

Criteria of Irreducible Polynomials over an Unique Factorization Domain R;

唯一分解整环R上不可约多项式的一些判别准则

The Irreducible Quadratic Factorizations of the Polynomial x~n-bx-a;

多项式x~n-bx-a的二次不可约因式

Applications of Minimal Unsatisfiable Formulas to Polynomially Reduction for Formulas

极小不可满足公式在多项式归约中的应用

The New Proof of the Irreducibility of Cyclotomic Polynomial in Z[x];

分圆多项式在Ζ[x]中不可约性的新证明

An Algorithm for the Determination of the Unreducibility of Polynomial f(x)mod p;

多项式f(x)mod p不可约的一种判别算法

Some Critical Theorems of the Irreducibility of the Integer Polynomial in the Rational Field;

整系数多项式在有理数域上不可约的几个判定定理

A Differentiation of the irreduvible of the Rational Number On-field Whole Coefficient Odd -time Polynomials;

有理数域上整系数奇次多项式不可约的一个判别法

Recurrence Formula for Unreliability Polynomial of Graphs

图的不可靠性多项式的递推公式(英文)

sufficiently many irreducible unitary representations

充分多的不可约酉表示

The Reduction about Polynomial Bezout Matrix and the Inverse of Vandermonde Matrix;

多项式Bezout矩阵的约化与Vandermonde矩阵的逆

Several polynomial solvable problems with deteriorating jobs and an availability constraint

带不可用时间段和恶化加工时间的几个多项式可解问题

Strong Converse Inequality for Multivariate Stancu Polynomials

多元Stancu多项式的强逆不等式

FactorGEP:a novel factorization of polynomial algorithm based on GEP with gene reduction strategy

基于GEP基因约简策略的多项式因式分解

Heuristic Algorithm for Aerospace Multi-project Scheduling with Multi-resource Constraints

多资源约束下航天多项目调度的启发式算法

Admissibility of Linear Predictor in the Multivariate Linear Models with Respect to Inequality Constraints

不等式约束多元线性模型中线性预测的可容许性