文中在不同的条件下对它们给出了多项式时间算法。
Some polynomial algorithms are developed for them under different conditions.
最后给出了一个求f D集最优覆盖的多项式时间算法。
Finally, a polynomial time algorithm for solving an optimal cover of FD set is given.
理论分析与实验结果表明该方法是确定性的多项式时间算法。
Both theoretic analyses and testing results show that the new method is a deterministic polynomial time algorithm.
本文从代数及组合两个方面论证了NP完全问题存在多项式时间算法。
In this paper, the polynimial time algorithms of the NP complete problems are gained in the algebraical and combinatorial two aspects respectively.
以无基集为基础，结合最大无基集的定义，提出一个多项式时间算法。
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.
本文在利用优化性质的基础上，提出了一种适于大规模优化调度问题的多项式时间算法。
Basing on the optimal properties, this paper proposes a polynomial time algorithm which is suitable to solve the large scale scheduling problem.
本文研究了这样的特殊情形：树网络上所有起点处于同一条路上，建立了多项式时间算法。
In this paper we study such a special case: a tree network with all sources on a path and we present its polynomial-time algorithms.
本文对运输问题的原设-对偶算法运用推拉流思想进行改进，得到一个拟多项式时间算法。
Based on the N-person cooperative game theory, this paper puts forward a model of the minimum cost allocation of transportation problem.
内点法是一种求解线性规划问题的多项式时间算法，其显著特征是其迭代次数与系统规模关系不大。
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.
本文给出了一个新的匹配协议，该协议是语义安全的，不存在概率多项式时间算法区分对两个输入的猜测值。
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.
摘要本文对线性规划提出了一个不可行内点原始-对偶仿射尺度算法，并证明了算法是一个多项式时间算法。
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.
大量的关于随机的凸二次规划问题的数值实验结果表明它的计算效率是高的，在某些条件下可能是多项式时间算法。
Some numerical results for a large number of random convex quadratic programming problems show that the new algorithm is efficient and might be a polynomial-time algorithm under some conditions.
给出了具有频道负荷约束的专用移动无线电网络问题的整数线性规划，设计了求解特殊网络的具有频道负荷约束的频道分配问题的多项式时间算法。
An integer programming formulation for channel assignment problem with channel loading is presented and polynomial time algorithms are designed for some special radio networks in this paper.
例如 Shor的算法能在多项式时间内找到一个N位函数的周期。
Shor's algorithm, for example, is able to find the period of a function of N bits in polynomial time.
着重证明了K -树组法为多项式时间复杂性算法。
It is proved that K-Tree Term method is a multinomial time complexity algorithm.
在此基础上，以整数规划算法为数学工具给出了时间算法复杂度为多项式的最优基本信标的计算方法。
Furthermore, the integer programming method is exploited as the mathematical tool for the generation of a polynomial algorithm producing the optimal set elementary siphons.
设计了一个具有多项式时间复杂度的算法从流程私有部分自动生成相应的公开部分。
An algorithm with polynomial complexity was presented to generate the public part of the process from its private one.
同时，还给出了该问题的多项式时间近似算法。
A polynomial approximation algorithm for the problem is given.
这两类算法是在ML算法基础上放松约束条件，将问题转化为可在多项式时间内解决的凸优化问题。
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.
提出了节约原则模型的一个多项式时间的贪心算法以及一种把贪心策略和分支限界策略集合在统一框架下的复合算法。
For the parsimony this paper presents model a polynomial time greedy algorithm and a compound algorithm that combines the greedy policy with the branch-and-bound strategy in a uniform framework.
给出了二维数组的体差不等式测试算法，并证明二维数组的体差不等式测试算法具有多项式时间复杂度。
This paper presents a new dependence difference inequality test algorithm for two-dimensional arrays, and proves that the time complexity of the algorithm is polynomial.
给出了多项式时间的最优算法。
We provide a polynomial time algorithm to solve the problem.
提出了一种基于条件信息熵的知识约简启发式算法，并指出该算法的时间复杂度是多项式的。
A heuristic algorithm based on conditional information entropy for knowledge reduction is proposed, and the complexity of this algorithm is analyzed.
并且对这两类问题都研究了他们的计算复杂性并给出了最优算法或者多项式时间近似算法。
For both problems, we study their computational complexity and present optimal algorithms or polynomial time approximation algorithms.
定理2.1：算法2.1是一个多项式时间近似方案定理2.2程序结束时每个要求所对应的两点之间的路径是唯一的。
Theorem2.1: Algorithm2.1 is a Polynomial time approximation scheme Theorem2.2 When Algorithm2.1 end, the path between each node pairs which.
该算法采用矩形对换道车辆及障碍车辆进行包裹，结合换道车辆的边界条件由以时间为参数的多项式计算得到换道轨迹。
This algorithm used of rectangles for target vehicle and obstacle vehicles representation, combined with target vehicle's states and polynomial theory to generate lane changing trajectory.
算法在统计意义下为多项式时间复杂度。
The algorithm's complexity of calculation is polynomial in a speciftc statistic's sense.
算法在统计意义下为多项式时间复杂度。
The algorithm's complexity of calculation is polynomial in a speciftc statistic's sense.
应用推荐