多项式算法的英文

发音:

英文翻译
造句

multinomial algorithm
polynomial algorithm

多项式 multinomial; polymerization; ...
算法 algorithm
多项式复杂性算法 polynomial complexity algorithm
多项式时间算法 polynomial time algorithm
多项式为界算法 polynomial bounded algorithm
多项式 multinomial; polymerization; polynome; polynomial; polynomial expression◇多项式逼近 approximation by polynomial; 多项式表示 polynomial representation; 多项式插值 polynomial interopolation; 多项式插值函数 polynomial interpolating function; 多项式次数 degree of polynomial; 多项式定理 multinomial theorem; 多项式复杂性polynomial complexity; 多项式函数 polynomial function; 多项式解 solution by polynomials; 多项式决策规则 polynomial dicision rule; 多项式系数 multinomial coefficient; 多项式形式 polynomial form; 多项式展开 polynomial expansion
多项式的，多项式 polynomial
辞典式算法 lexicographic algorithm
分布式算法 distributed algorithm
启发式算法 heuristic algorithm
试探式算法 heuristic algorithm
显式算法 explicit algorithm
线式算法 stack algorithm
页式算法 paging algorithm
隐式算法 implicit algorithm
多项式多项的 multinomial
表驱动式算法 table-driven algorithm
乘积形式算法 product form algorithm
探试算法, 启发式算法 heuristic algorithm
n次多项式 polynomial of degree n; polynomial of n th degree
伴随多项式 associated polynomial
本原多项式 primitive polynomial
标准多项式 standard polynomial
病态多项式 ill-conditioned polynomial
不变多项式 invariant polynomial

"查查词典"手机版

千万人都在用的超大词汇词典翻译APP

例句与用法

That is to say , we can not use any polynomial algorithm to solve this kind of problems
也就是说，不能用任何已知的多项式算法求解这种问题。
Four special capacity expansion problem of undirected network were discussed and the responsible strongly polynomial algorithm was get
讨论了无向网络容量扩充的4种特殊问题，给出了相应的强多项式算法
The bin packing problem belongs to the most complicated calculated problem : npc problem ( nondeterminstic polynomial complete )
装箱问题是具有最高计算复杂性的一类问题： npc ( nondeterministicpolynomialcomplete非确定型多项式算法)类问题。
A new way to get the inflection point is brought forward . . it is to get the inflection point by using the least square imitate multinomial arithmetic . the result of experiment show that the method is right
采用了一种全新的计算拐点特征的方法，即：最小二乘拟合一次多项式算法计算手写体数字的左右拐点。
Furthermore , the vertex - neighbor - scattering number of trees is discussed in details . the main contents of chapter 4 are the introduction of edge - neighbor - scattering number of graphs , the edge - neighbor - scattering number values of several simple graphs and a polynomial algorithm of the edge - neighbor - scattering number of trees
第四章主要定义图的边邻域离散数，给出一些基本图的边邻域离散数值，图的边邻域离散数的界，树的边邻域离散数的一个多项式算法。
Abstract : in this paper , we discussed a new kind of single machine scheduling problems with controllable processing times . the objective function being considered was the sum of weighted completion times of all jobs plus the maximum dissatisfaction of all jobs ' processing times that deviated from their specified ones . we presented a polynomial algorithm to solve the problem
文摘:本文讨论了一类新的加工时间可控的单机排序问题.我们所考虑的目标函数由所有工件的加权完工时间之和与对所有工件的实际加工时间偏离额定加工时间的最大不满意程度这两部分组成.对此问题,我们提出了一个多项式算法