polynomial time

基本解釋

Shor's algorithm, for example, is able to find the period of a function of N bits in polynomial time.
例如 Shor 的算法能在多項(xiàng)式時(shí)間內(nèi)找到一個(gè) N 位函數(shù)的周期。
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.
本文給出了一個(gè)新的匹配協(xié)議，該協(xié)議是語義安全的，不存在概率多項(xiàng)式時(shí)間算法區(qū)分對兩個(gè)輸入的猜測值。
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.
內(nèi)點(diǎn)法是一種求解線性規(guī)劃問題的多項(xiàng)式時(shí)間算法，其顯著特征是其迭代次數(shù)與系統(tǒng)規(guī)模關(guān)系不大。

Typically up till now, we've looked at things that can be done in sublinear time. Or, at worst, polynomial time. We'll now look at a problem that does not fall into that. And we'll start with what's called the continuous knapsack problem.
至今為止我們已經(jīng)處理過,亞線性問題，最多也就是多項(xiàng)式問題,我們現(xiàn)在要看的問題則是不能用這些解決的,我們將要開始講連續(xù)背包問題。
麻省理工公開課 - 計(jì)算機(jī)科學(xué)及編程導(dǎo)論課程節(jié)選

polynomial -time Church-Turing thesis 多項(xiàng)式定時(shí)邱池
Polynomial -time solution 多項(xiàng)式時(shí)間
Bounded -error Probabilistic Logarithmic-space Polynomial-time 有限錯(cuò)誤機(jī)率對數(shù)空間多項(xiàng)式時(shí)間