查询词典 polynomial

For different polynomials g, if the characteristic polynomial of a n matrix A is irreducible, then we get some theorems to determine matrix equations g =A solvable; if it is reducible, then, to see n-dimension space vectors M over a field F as F-module, we use module theory to determine these equations solvable such that it is simpler and clearer to investigate these questions.

对于不同多项式g，当n阶矩阵A的特征多项式为不可约的，我们给出了矩阵方程g=A有解的判定定理；当A的特征多项式为可约的，把域F上的n维线性空间M作为由A导出的F -模，我们利用模论知识来决定矩阵方程g=A有解性，从而使这一问题变了简单，研究思路更加清晰。

An efficient and deterministic method is proposed to determine whether a polynomial over finite fields is irreducible or not.

提出了一个判定有限域上任一多项式是否为不可约多项式、本原多项式的高效的确定性算法。

The time-temperature superposition was proceeded by the WLF computer program. At first the isotherm or isochrone tests were fitted with polynomial app...

发现，当复合材料中纤维与橡胶粘合较牢固时，复合材料的贮能模量较高，在低频范围(00Hz)力学损耗较小。

As an application of the new algorithm, we study the conditions of the origin to be a center and to be an isochronous center for a class of polynomial system.

作为递推公式的应用，我们还解决了一类多项式系统原点的中心与等时中心条件问题。

As it is well known,the graph isomorphism problem is one of a very smallnumber of problems neither known to be solvable in polynomial time norNP-complete.

目前理论上还无法证明图的同构问题究竟属于NP—完全问题还是P问题。

Since the graph isomorphism problem is neither known to be NP-complete nor to be tractable, researchers have sought to gain insight into the problem by defining a new class GI, the set of problems with a polynomial-time Turing reduction to the graph isomorphism problem.

由于图同构的问题既不是已知的NP完全问题，也不是听话的，研究人员设法深入了解这个问题，确定了一类新基的一系列问题，多项式时间图灵减少的图同构问题。

That it lies in Parity P means that the graph isomorphism problem is no harder than determining whether a polynomial-time nondeterministic Turing machine has an even or odd number of accepting paths.

它在于奇偶P代表说，图同构的问题是没有比确定是否多项式时间非确定性图灵机有一个甚至或奇数接受路径。

At the same time, isomorphism for many special classes of graphs can be solved in polynomial time, and in practice graph isomorphism can often be solved efficiently.

与此同时，同构为许多特殊类别的图形就可以解决在多项式时间内，并在实践中图同构，往往可以有效地解决。

In this paper the polynomial minimal surface in isothermal parameter is discussed.

本文用CAGD的方法对极小曲面造型做了一些基础研究工作。

The exact modedling methods include: representation and construction of control mesh of some special minimal surface; exploration and properties of polynomial parametric minimal surfaces with isothermal parameter.

精确造型方法主要包括两个部分：某些特殊极小曲面的控制网格表示与构造；等温参数多项式极小曲面的挖掘与性质。

In the negative and interrogative forms, of course, this is identical to the non-emphatic forms.

。但是，在否定句或疑问句里，这种带有"do"的方法表达的效果却没有什么强调的意思。

Go down on one's knees;kneel down

屈膝跪下。。。下跪祈祷