A polynomial algorithm to find the maximum induced forest of a strongly chordal graph is given.
文中同时给出了在强弦图上求最大导出森林的多项式算法。
The problem of perfect sorting by reversals and deletions was considered, and one kind of polynomial algorithm was given.
研究了基于翻转和删除形式的染色体完美重组问题，并给出了多项式算法。
The transport problem with fixed charge is a kind of NP problem, and there is no polynomial algorithm which can solve it.
带固定费用的运输问题是一类NP难题，没有多项式算法可以求解。
A Characteristic polynomial algorithm for computation of Chebyshev polynomial over finite field is modified to achieve faster execution speed.
对计算有限域上切比雪夫多项式的特征多项式算法进行改进以提高算法的执行速度。
The results of the polynomial algorithm show that over 30% of inventory costs is saved compared with conventional methods without further resource consumption.
相对于已有的方法，在不增加资源使用量的情况下，该方法可以节约平均库存成本30%以上。
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.
在此基础上，以整数规划算法为数学工具给出了时间算法复杂度为多项式的最优基本信标的计算方法。
Then we construct a capacity cost network from the debt credit degree network. Finally, by applying minimum cost circulation flow problem, we give a polynomial algorithm for this model.
然后由债务信度网络构造了容量费用网络，利用最小费用循环流问题给出了该模型的一个多项式算法。
We study uncapacitated version of the minimum cost flow problem of one-commodity and two-commodity with not only fixed cost but also variable cost, and give them each a polynomial algorithm.
本文研究了无容量限制的带固定费用和可变费用的单物资和二物资的最小费用流问题，并分别给出了多项式算法。
We study uncapacitated version of the minimum cost flow problem of one-commodity and two-commodity with not only fixed cost but also variable cost, and give them each a polynomial algorithm.
建立了求解铁路局范围内请求车审批优化的数学模型和与此模型对应的网络图，将铁路请求车审批优化问题转换为求解最小费用最大流问题。
In the paper, a model based diagnosis using qualitative causal model and polynomial algorithm is presented, which has less computation burden and the correctness of this new algorithm is proved.
提出一种使用定性因果与多项式算法的模型诊断方法，此方法可以明显地减少诊断的计算量，并且对这种新算法的正确性给予了证明。
Shor's algorithm, for example, is able to find the period of a function of N bits in polynomial time.
例如 Shor的算法能在多项式时间内找到一个N位函数的周期。
To enhance the triangle quality of the simplified mesh, a novel triangular mesh simplification algorithm based on local polynomial fitting surface of vertices was proposed.
为了提高网格简化后的三角形质量，提出了一种新的基于顶点局部多项式曲面拟合的三角网格简化算法。
This paper presents a infeasible interior-point primal -dual affine scaling algorithm for linear programming. it is shown that the method is polynomial-time algorithm.
摘要本文对线性规划提出了一个不可行内点原始-对偶仿射尺度算法，并证明了算法是一个多项式时间算法。
In this paper, we present a new match protocol. It is of semantic security: there exists no probabilistic polynomial time algorithm to distinguish two guessed inputs.
本文给出了一个新的匹配协议，该协议是语义安全的，不存在概率多项式时间算法区分对两个输入的猜测值。
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.
内点法是一种求解线性规划问题的多项式时间算法，其显著特征是其迭代次数与系统规模关系不大。
This paper presents a parallel algorithm for Lagrange's polynomial interpolation which is based on cluster parallel environment.
提出在机群系统并行环境下的构造拉格朗日插值多项式的一种并行算法。
Basing on the optimal properties, this paper proposes a polynomial time algorithm which is suitable to solve the large scale scheduling problem.
本文在利用优化性质的基础上，提出了一种适于大规模优化调度问题的多项式时间算法。
Through the finite domain multiplier design based on the polynomial multiplication theory in finite domain, a new simple multiplication algorithm in finite domain is introduced.
采用基于有限域中多项式乘法理论的快速有限域乘法器的设计，得到了简单的有限域上乘积运算算法。
Finally, based on the theorem, a polynomial 2 approximation algorithm for the location problem is presented.
最后，基于此定理，给出了选址问题的一个多项式2近似算法。
By using this formula, orthogonal polynomial fitting algorithm for initial value problems of ordinary differential equations is established.
利用这一公式建立了常微分方程初值问题的正交多项式拟合算法。
Both theoretic analyses and testing results show that the new method is a deterministic polynomial time algorithm.
理论分析与实验结果表明该方法是确定性的多项式时间算法。
Based on the definitions of the unfounded set and the greatest unfounded set, it proposes a polynomial time algorithm.
以无基集为基础，结合最大无基集的定义，提出一个多项式时间算法。
This paper presents a polynomial time algorithm for finding Rectilinear-Steiner-Trees by statistical analysis.
本文利用统计分析法，提出求解矩形斯坦纳树问题的多项式时间算法。
This paper proposes a rigorous algorithm for solving the 0-1 polynomial knapsack problem.
提出了0-1多项式背包问题的一种新的精确算法。
An algorithm with polynomial complexity was presented to generate the public part of the process from its private one.
设计了一个具有多项式时间复杂度的算法从流程私有部分自动生成相应的公开部分。
Finally, we present an efficient algorithm for computing the minimal polynomial of a polynomial matrix. It determines the coefficient polynomials term by term from lower to higher degree.
最后，我们给出了一种计算多项式矩阵最小多项式或特征多项式的有效算法，它从低次项到高次项逐项确定最小多项式的系数多项式。
The algorithm is polynomial curve fitting based on least square approximation. The experimental result shows its performance is more effect than that of the piecewise linear algorithm.
该算法是在最小二乘意义上的多项式曲线拟合，实验结果表明，其校正效果明显优于分段线性校正算法。
The algorithm is polynomial curve fitting based on least square approximation. The experimental result shows its performance is more effect than that of the piecewise linear algorithm.
该算法是在最小二乘意义上的多项式曲线拟合，实验结果表明，其校正效果明显优于分段线性校正算法。
应用推荐