查询词典 polynomially

This implies the existence of a polynomially bounded algorithm to find a shortest contractible cycle, a shortest separating cycle, and shortest cycle in an embedded graph in the projective plane and answers the open problems raised by Mohar and Thomassen in the case of projective plane embedded graph.

另一方面，通过定义嵌入图的几何对偶图及其相应的嵌入系统，得到几何对偶图中的可分离圈就对应于原图中的割；反之，若几何对偶图中的割在原图中对应于一个圈，那么该圈一定可分离。

RIE is polynomially secure, and is very efficient in that its message expansion is 1+(k-1)/1 (where k is the security parameter and 1 the length of the encrypted message).

RIE是多项式安全的，并且效率较高，其信息膨胀率为1+（k-1）/1（k是安全参数，1是被加密数据的长度）。

Meanwhile,we establishψfunctional stability which is more general than the classical exponential stability and polynomially stability.

我们通过对几类方程的讨论，将不同的渐近稳定性借助于&ψ函数&归结为一种&ψ函数稳定性&。

By an improved Ford-Fulkerson algorithm, we obtain a polynomially bounded algorithm for finding the shortest co-cycle.

本文通过改进的Ford-Fulkerson算法，可以得到最短割算法。

We then construct a subspace, dense in the underlying statespace, for which the corresponding solutions decay polynomially whenever theinitial states belong to it.

我们构造了稠于初始状态空间的子空间，使得相应方程的解多项式衰减。

We successively pose a sampling method for robust fuzzy convex optimization, with the sampled problem being polynomially solvable.

对这类问题，本文导出了其确定性等价最优化问题，分析了其可行集的性质，接着对鲁棒模糊凸最优化问题给出了一种样本方法。

The polynomially fitted values of the molar heat capacities and fundamental thermodynamic functions of the sample relative to the standard reference temperature 298.15 K were calculated and tabulated at an interval of 5 K.

通过热容多项式方程的数值积分，得到了这个化合物的舒平热容值和相对于298.15 K的各种热力学函数值，并且将每隔5 K的热力学函数值列成了表格。

We also show that for a fixed surface S, if the face-width of an embedded graph 0 in S is large enough, then there exists a polynomially bounded algorithm to find a shortest contractible cycle in G.

从而在射影平面上解决了Mohar与Thomassen关于是否存在多项式算法寻找短圈的问题。对于一般曲面上嵌入图，只要它的面宽度充分大，那么同样有多项式算法发现最短可收缩圈。

This kind of parallel processing hugely improves the computational speed, and can change some NP problems that cannot be accomplished by classical computers, i.e., the complexity of the problems exponentially increases with the increase of bits, to P problems, i.e., the complexity of the problems polynomially increases with the increase of bits. In 1994 Peter Shor at Bell Laboratory proved that quantum computers could efficiently solve the problem of Large Number Factorization, which was the security footstone of nowaday classical cryptosystems, while none of any classical computers could implement this.

这种并行处理极大地提高了计算速度，可以把一些经典计算中无法计算的NP问题即问题的复杂度随着比特位数的增长而指数上升，变成P问题即问题的复杂度随着比特位数的增长以多项式上升。1994年，Bell实验室的Peter Shor证明量子计算机可以有效解决经典计算机所不能解决的大数因子分解问题，而这恰恰是目前经典密码的安全性基础。

Using the method presented in this paper, the plant templates of a plant with an uncertain time-delay and polynomially dependent uncertain parameters in an ellipsoid can be accurately generated.

用本文所提出之方法，具有未确定时延，未确定位於椭球内且为多项式相依之程序，其程序模板可被准确地产生。

As she looked at Warrington's manly face, and dark, melancholy eyes, she had settled in her mind that he must have been the victim of an unhappy attachment.

每逢看到沃林顿那刚毅的脸，那乌黑、忧郁的眼睛，她便会相信，他一定作过不幸的爱情的受害者。

Maybe they'll disappear into a pothole.

也许他们将在壶穴里消失