多項式時間
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的某個幂次方加上一些常數項的形式。
多項式時間算法是指能夠在多項式時間内運行的算法。這種算法在計算機科學中非常重要，因為它們能夠高效地解決許多實際問題，例如圖像處理、自然語言處理和數據挖掘等領域。
以下是一些關于多項式時間的例句和用法：
多項式時間的近義詞是“多項式複雜度”，反義詞是“指數時間複雜度”。
【别人正在浏覽】