We provide a polynomial time algorithm to solve the problem.
给出了多项式时间的最优算法。
A polynomial approximation algorithm for the problem is given.
同时，还给出了该问题的多项式时间近似算法。
A polynomial time approximation scheme (PTAS) for this problem is presented.
给出了一个多项式时间近似方案(PTAS)。
Finally, a polynomial time algorithm for solving an optimal cover of FD set is given.
最后给出了一个求f D集最优覆盖的多项式时间算法。
The formula manipulation by a computer will eventually result in a polynomial manipulation.
利用计算机进行公式推导，最终将归结于多项式的处理。
A polynomial algorithm to find the maximum induced forest of a strongly chordal graph is given.
文中同时给出了在强弦图上求最大导出森林的多项式算法。
The purpose is to estimate unknown parameters and nonparametric function using a polynomial spline method.
旨在利用多项式样条方法，对未知参数和非参数函数进行估计。
Finally, based on the theorem, a polynomial 2 approximation algorithm for the location problem is presented.
最后，基于此定理，给出了选址问题的一个多项式2近似算法。
This paper presents a polynomial time algorithm for finding Rectilinear-Steiner-Trees by statistical analysis.
本文利用统计分析法，提出求解矩形斯坦纳树问题的多项式时间算法。
To observe the character of singularity loci clearly, a polynomial form of the singularity loci are also derived.
为了清楚地观察奇异形位的特征，本文还得到了奇异表达式的多项式形式。
In this paper, we prove this problem to be a difficult problem that is NP complete through a polynomial reduction.
本文给出了多项式时间规约证明了在一般图上该问题是一个困难问题，即是NP完全的。
SDNM is a polynomial time algorithm with the Newtons method, so that SDNM can solve large-scale linear inequalities.
它在理论上是多项式算法，并可以从任意点启动，可以应用共轭梯度方法有效地求解大规模线性不等式组问题。
Based on the definitions of the unfounded set and the greatest unfounded set, it proposes a polynomial time algorithm.
以无基集为基础，结合最大无基集的定义，提出一个多项式时间算法。
When using a polynomial spline to plan the trajectory of a dynamic system, it is very difficult to manage dynamic constraints.
在利用多项式样条插值方法进行动力学系统的轨迹规划时，存在无法处理动力学约束的问题。
A group key distribution scheme utilizing a polynomial expansion is proposed, which features in no traditional encryption and decryption.
提出了一种利用多项式展开的组密钥分配方案，其特点是不使用传统加密和解密。
A polynomial function supervising PID control method is proposed, which is based on Genetic Algorithms (GAs) for real-time control process.
针对实时控制过程提出一种基于遗传算法的多项式函数监督PID控制。
Basing on the optimal properties, this paper proposes a polynomial time algorithm which is suitable to solve the large scale scheduling problem.
本文在利用优化性质的基础上，提出了一种适于大规模优化调度问题的多项式时间算法。
The ratio of voltage warp(RVW) for the varistor is defined to simulate a polynomial of every diameter and suspended heights of the grading ring.
定义了阀片电压偏差率并以此为目标函数，建立该目标函数与各均压环环直径和悬挂高度的拟合多项式关系。
The exact solutions to dispersive long-wave equations are obtained by a polynomial expansion method based on the idea of the homogeneous balance method.
基于齐次平衡法的思想，利用多项式展开法解得了具有色散项的长波方程组的精确解。
These two algorithms relax the constraints of ML algorithm and transform it into a convex problem which can be efficiently solved with a polynomial time.
这两类算法是在ML算法基础上放松约束条件，将问题转化为可在多项式时间内解决的凸优化问题。
The method presented in this paper is not to approximate directly with Newton iterate the roots of a polynomial but to approximate its second order factors.
本文提出的这种方法，它的特点在于：我们不是用牛顿迭代法去直接逼近方程的根，而是用牛顿迭代法去逼近方程的二次因子。
A polynomial may be used during analysis to generate a metric indicating the suitability of the sensing vector for use in cardiac event detection and analysis.
在分析期间可使用多项式生成指明感测矢量用于心脏事件检测和分析的适合性的量度。
We use network coding, i. e. , allowing intermediate nodes to code, the problem can be formulated as a linear program problem and has a polynomial-time solution.
利用网络编码，允许中间节点进行信息编码，最小能量广播问题可以转化为一个线性规划问题，并且具有一个多项式时间解。
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.
内点法是一种求解线性规划问题的多项式时间算法，其显著特征是其迭代次数与系统规模关系不大。
A polynomial algorithm about minimal marking of structural live Petri nets is presented, it is based on incidence matrix and the constructive of transitions sequence.
从网的关联矩阵以及所定义变迁发生序列的结构，求解结构活网的极小标识，得到了一个多项式时间算法。
Furthermore, the integer programming method is exploited as the mathematical tool for the generation of a polynomial algorithm producing the optimal set elementary siphons.
在此基础上，以整数规划算法为数学工具给出了时间算法复杂度为多项式的最优基本信标的计算方法。
The experimental data of this work were correlated as a polynomial function of the temperature. The average and maximum relative deviation were 0.49% and 1.21%, respectively.
利用本文实验数据拟合了甲基叔丁醚饱和液相粘度方程，方程和实验数据的平均和最大相对偏差分别为0．49%和1．21%，可以满足工程实际应用．。
The experimental data of this work were correlated as a polynomial function of the temperature. The average and maximum relative deviation were 0.49% and 1.21%, respectively.
利用本文实验数据拟合了甲基叔丁醚饱和液相粘度方程，方程和实验数据的平均和最大相对偏差分别为0．49%和1．21%，可以满足工程实际应用．。
应用推荐