We provide a polynomial time algorithm to solve the problem.
给出了多项式时间的最优算法。
Note: Your solution should be in polynomial time complexity.
注意：你的解法应该满足多项式时间复杂度。
A polynomial time approximation scheme (PTAS) for this problem is presented.
给出了一个多项式时间近似方案(PTAS)。
The complexity of DSAFO is bounded between quadratic and cubic polynomial time.
DSAFO算法具有不错的时间复杂度：介于平方和三次方之间。
Polynomial time algorithms are given for some special types of connected assignment.
对某些特殊类型的分配问题，给出了多项式复杂性的分配算法。
Finally, a polynomial time algorithm for solving an optimal cover of FD set is given.
最后给出了一个求f D集最优覆盖的多项式时间算法。
Shor's algorithm, for example, is able to find the period of a function of N bits in polynomial time.
例如 Shor的算法能在多项式时间内找到一个N位函数的周期。
A polynomial time algorithm for the scheduling problem of identical coupled-task jobs is presented in.
研究了一个特殊的整数瓶颈问题并给出了两个求最优解的多项式算法程序。
This paper presents a polynomial time algorithm for finding Rectilinear-Steiner-Trees by statistical analysis.
本文利用统计分析法，提出求解矩形斯坦纳树问题的多项式时间算法。
Both theoretic analyses and testing results show that the new method is a deterministic polynomial time algorithm.
理论分析与实验结果表明该方法是确定性的多项式时间算法。
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.
以无基集为基础，结合最大无基集的定义，提出一个多项式时间算法。
For both problems, we study their computational complexity and present optimal algorithms or polynomial time approximation algorithms.
并且对这两类问题都研究了他们的计算复杂性并给出了最优算法或者多项式时间近似算法。
Theorem2.1: Algorithm2.1 is a Polynomial time approximation scheme Theorem2.2 When Algorithm2.1 end, the path between each node pairs which.
定理2.1：算法2.1是一个多项式时间近似方案定理2.2程序结束时每个要求所对应的两点之间的路径是唯一的。
Basing on the optimal properties, this paper proposes a polynomial time algorithm which is suitable to solve the large scale scheduling problem.
本文在利用优化性质的基础上，提出了一种适于大规模优化调度问题的多项式时间算法。
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算法基础上放松约束条件，将问题转化为可在多项式时间内解决的凸优化问题。
SAT problem belongs to the NP class, that is, theoretically it can't be solved in polynomial time and solving it exceeds the capability of modern computer.
SAT问题是NP完全问题，从理论上说，SAT问题不能在多项式时间内解决，它超出了现代计算机的能力。
It is intended to prove that the of the optimum displaying problems related with geometry data solution can be found in polynomial time, under certain condition.
证明在一定条件下，与地理相关数据的最优显示问题在多项式时间内可解。
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.
内点法是一种求解线性规划问题的多项式时间算法，其显著特征是其迭代次数与系统规模关系不大。
For no-waited model, we show it is strongly NP-hard, and present a pseudo-polynomial time optimal algorithm and an approximation algorithm with worst-case ratio 5/3.
对于不可等待的情况证明了它是强NP-难的，并给出了动态规划算法和一个最坏情况界为5/3的近似算法。
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.
本文给出了一个新的匹配协议，该协议是语义安全的，不存在概率多项式时间算法区分对两个输入的猜测值。
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.
给出了具有频道负荷约束的专用移动无线电网络问题的整数线性规划，设计了求解特殊网络的具有频道负荷约束的频道分配问题的多项式时间算法。
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 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.
大量的关于随机的凸二次规划问题的数值实验结果表明它的计算效率是高的，在某些条件下可能是多项式时间算法。
The dynamic load identification is formulated by time finite element model with shape function of generalized orthogonal polynomial in this paper.
本文利用广义正交多项式作为时间有限元的形函数，推导了基于时间有限元的动载荷识别模型。
Fan J and Gijbels I gave the asymptotic normality of local polynomial regression estimation in dependent time series, where the weighted function is bounded.
对相依时间序列数据，在一定的条件下已有人证明了局部多项式加权回归系数估计服从渐近正态分布，其中核函数是有界的。
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.
给出了二维数组的体差不等式测试算法，并证明二维数组的体差不等式测试算法具有多项式时间复杂度。
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.
给出了二维数组的体差不等式测试算法，并证明二维数组的体差不等式测试算法具有多项式时间复杂度。
应用推荐