1) polynomial method
多项式方案
1.
METHODS: Long-distance prediction system SYFPEITHI and polynomial method were used to predict the HLA-A2 restricted CTL epitopes of TAG1.
方法:利用SYFPEITHI法和多项式方案结合预测TAG1的HLAA2限制性CTL表位,并将预测所得表位基因片断双串连后进行生物合成,克隆入带有GST标签并含Hsp70基因的原核表达载体,在IPTG诱导表达后,用GST蛋白纯化系统纯化。
2) polynomial time approximation scheme
多项式时间近似方案
1.
We construct an new 2 dimension networks based on the given networks, using the algorithm of restricted shortest path problem, we then give a polynomial time approximation scheme for this problem with two pair of points.
本文设法在原有网络基础上构造出一个新的 2维网络 ,然后利用约束最短路问题的算法给出一个点对数为 2时的多项式时间近似方案 (PTAS)。
2.
in first section we discuss undirected rings and tree of rings loading problem,including the first and second chapter; In second section we discuss directed rings and tree of rings loading problem,including the third and forth chapter;in the third sections we put forward a polynomial time approximation scheme( PTAS)for the improved bi-directed ring loading problem, including the fifth chapter.
第三部分提出改进的有向环负载问题的多项式时间近似方案，包括第五章。
3) fully polynomial time approximation scheme
多项式时间近似方案
1.
The NP-hardness of a delay constrained Steiner minimum tree problem in a special series-paraUel graph is proved in this paper,and a fully polynomial time approximation scheme is presented.
对一类特殊系列平行图上带有时间约束的Steiner最小树问题,证明了其复杂性为NPC,并给出了一个完全多项式时间近似方案。
4) PTAS
多项式时间近似方案
1.
A PTAS for the Scheduling and Wavelength Assignment Problem in WDM Networks;
WDM网络中的排序与波长分配问题的一个多项式时间近似方案(英文)
2.
A new technique to design polynomial time approximation schemes(PTAS) for NP hard problems in Euclidean space is introduced.
提出了一种在欧氏平面上设计多项式时间近似方案的新技术 。
5) polynomial equation
多项式方程
1.
Thus, finding practical and efficient methods (not necessary to be decision method) to solve systems of large polynomial equations and inequalities is very important in symbolic computation.
因此寻找求解多项式方程与不等式组的有效方法 (未必是判定方法 )是符号计算中的重要问题 。
2.
Aiming at solving real roots of unitary real coefficient s polynomial equation, a practical numeric solution is put forward .
对于一元实系数多项式方程的求根问题 ,提出了一种实用的数值解法 ,对一般的牛顿迭代法进行了改进和完善 ,研究了 5次以上多项式方程在整个实数域中的根的求解及迭代快速逼近的问
3.
On the basis of the character of the root of polynomial equation and well-known Newton Formula,the paper present a method to extract all real roots of polynomial equation and define initial value of iteration.
运用多项式方程根的性质理论及著名的牛顿公式，解决了牛顿公式用于多项式方程时迭代初值的选取，并求出多项式方程的所有实根。
6) polynomial equations
多项式方程
1.
In this paper,a class of linear quadratic control problem is solved by using the method of polynomial equations.
使用多项式方程方法解决一类线性二次控制问题。
补充资料：多项式乘多项式法则
Image:1173836820929048.jpg
多项式乘多项式法则
先用一个多项式的每一项乘以另一个多项式的每一项，再把所得的积相加。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。