go top

## polynomial time

• 多项式时间

### 网络释义专业释义

[计] 多项式时间

多项式定时

polynomial-time complexity 多项式时间复杂性

polynomial-time reduction 多项式时间还元

polynomial-time 多项式时间

Polynomial-time Hierarchy 多项式时间谱系PH

polynomial-time algorithms 多项式时间算法

更多收起网络短语
• 多项式时间
多项式定时
• 多项式时间
• 多项式时间

·2,447,543篇论文数据，部分数据来源于NoteExpress

### 双语例句原声例句

• Shor's algorithm, for example, is able to find the period of a function of N bits in polynomial time.

例如 Shor 算法多项式时间找到一个 N 函数周期

• 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.

本文给出了一个新的匹配协议，该协议语义安全存在概率多项式时间算法区分两个输入猜测值。

• 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.

点法一种求解线性规划问题多项式时间算法显著特征迭代次数系统规模关系不大。

• 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.

至今为止我们已经处理过,亚线性问题，最多也就是多项式问题,我们现在要看的问题则是不能用这些解决的,我们将要开始讲连续背包问题。

麻省理工公开课 - 计算机科学及编程导论课程节选

\$firstVoiceSent
- 来自原声例句