多项式时间
To this day, researchers have found only a few other quantum algorithms that appear to provide a speedup from exponential to polynomial time for a problem.
到目前为止，研究人员只找到少数的量子演算法，可以将一个问题的计算所需时间，由指数时间降到多项式时间。
This paper presents a polynomial time greedy algorithm and a compound algorithm that combines the greedy policy with the branch-and-bound strategy in a uniform framework.
因此，我们为其设计了一个多项式时间的贪心算法以及一个将贪心策略和分支限界策略集合在统一框架下的复合算法。
Both theoretic analyses and testing results show that the new method is a deterministic polynomial time algorithm.
理论分析与实验结果表明该方法是确定性的多项式时间算法。
This paper proposes a pseudo-polynomial time algorithm for computing least-cost paths satisfying the explicit node constraint in directed acyclic networks with integer link costs.
对链路代价值为整数的有向无回路网络，文章提出了一种伪多项式时间算法，用于计算满足指定节点约束的最小代价路径。
Given the public-key and a ciphertext, we recover the corresponding plaintext in polynomial time.
给定公开密钥和密文，在多项式时间内还原相应的明文。
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.
内点法是一种求解线性规划问题的多项式时间算法，其显著特征是其迭代次数与系统规模关系不大。
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.
本文给出了一个新的匹配协议，该协议是语义安全的，不存在概率多项式时间算法区分对两个输入的猜测值。
Basing on the optimal properties, this paper proposes a polynomial time algorithm which is suitable to solve the large scale scheduling problem.
本文在利用优化性质的基础上，提出了一种适于大规模优化调度问题的多项式时间算法。
To relate message with graph, we give a constructing algorithm based on one-way permutation, then prove that it doesn't exist a probably algorithm for polynomial time to find acollide.
为了把报文与图联系起来，采用了基于单向置换的报文摘要生成算法，并证明了对该算法而言，不存在多项式时间的概率算法来找到一个“冲突”。
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.
提出了节约原则模型的一个多项式时间的贪心算法以及一种把贪心策略和分支限界策略集合在统一框架下的复合算法。
The AKS algorithm successfully solved the noted problem of deterministic primality testing in polynomial time, but it was not yet suitable for the real application, thus it was improved in series.
AKS算法从理论上成功解决了在多项式时间内进行确定性素性测定的著名难题，但它并不实用，从而得到一系列的改进。
A problem that is polynomial time equivalent to graph isomorphism is called isomorphism complete.
凡多项式时间等价于图同构检验的问题称为同构完全问题。
Based on the definitions of the unfounded set and the greatest unfounded set, it proposes a polynomial time algorithm.
以无基集为基础，结合最大无基集的定义，提出一个多项式时间算法。
Taking the maximum lateness as objective function, this paper develops a polynomial time algorithms for the processing sequence of then jobs given or not given.
文中以工件的最大迟后为目标函数，对工件加工顺序预先给定和可任意时的最优分批分别给出了多项式时间算法。
This paper presents a polynomial time algorithm for finding Rectilinear-Steiner-Trees by statistical analysis.
本文利用统计分析法，提出求解矩形斯坦纳树问题的多项式时间算法。
A new technique to design polynomial time approximation schemes(PTAS) for NP hard problems in Euclidean space is introduced.
提出了一种在欧氏平面上设计多项式时间近似方案的新技术。
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问题不能在多项式时间内解决，它超出了现代计算机的能力。
The paper offers polynomial time algorithm of the functional all-terminal reliability of cordal ring.
给出了弦环的实用全终端可靠度的一种计算方法，此方法是多项式时间的。
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.
最后给出了一个求FD集最优覆盖的多项式时间算法。
For both problems, we study their computational complexity and present optimal algorithms or polynomial time approximation algorithms.
并且对这两类问题都研究了他们的计算复杂性并给出了最优算法或者多项式时间近似算法。
We provide a polynomial time algorithm to solve the problem.
给出了多项式时间的最优算法。
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.
给出了具有频道负荷约束的专用移动无线电网络问题的整数线性规划，设计了求解特殊网络的具有频道负荷约束的频道分配问题的多项式时间算法。
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.
证明在一定条件下，与地理相关数据的最优显示问题在多项式时间内可解。
A heuristic method is presented for the scheduling algorithm to jump out local optimization and reach global optimization in polynomial time complexity.
采用启发式机制使得调度算法的解空间搜索过程具有跳出局部最优的能力，此算法可在多项式时间复杂度下得到全局最优调度解。
The global routing is composed of intra block routing and inter block routing. Both of them are polynomial time algorithms.
该算法由块内布线算法和块间布线算法两部分组成，它们的时间复杂性均为多项式时间算法。
"Polynomial time"（多项式时间）是计算复杂度理论中的核心概念，用于描述算法的时间效率。以下是详细解释：
多项式时间指算法的运行时间与输入规模( n )的关系可以表示为多项式函数，即时间复杂度为( O(n^k) )，其中( k )是一个常数。例如：
这些复杂度随着( n )的增长以多项式速率上升，而非指数级（如( O(2^n) )）或阶乘级（如( O(n!) )），因此被认为是高效的。
总结来说，多项式时间是衡量算法效率的关键标准，决定了问题的实际可解性，并在理论计算机科学中划分了P与NP的边界。
多项式时间（Polynomial-Time）是指一种时间复杂度的概念，指算法在处理规模为n的问题时，所需的运行时间可以表示为一个多项式函数。这里的多项式函数是指一个常数乘以n的某个幂次方加上一些常数项的形式。
多项式时间算法是指能够在多项式时间内运行的算法。这种算法在计算机科学中非常重要，因为它们能够高效地解决许多实际问题，例如图像处理、自然语言处理和数据挖掘等领域。
以下是一些关于多项式时间的例句和用法：
多项式时间的近义词是“多项式复杂度”，反义词是“指数时间复杂度”。
【别人正在浏览】