Note however, there is a pseudo-polynomial dynamic programming solution to subset sum that might be utilized here as well.
然而，有一个伪多项式时间的动态规划的解决方案的子集这可能被利用在这里就好了。
In this paper, we revise the graphical method by means of the Shortest path algorithm, and obtain two variants which are pseudo-polynomial algorithms.
本文利用最短路算法修订了图上作业法，得到了两个拟多项式算法。
For no-waited model, we show it is strongly NP-hard, and present a pseudo-polynomial time optimal algorithm and an approximation algorithm with worst-case ratio 5/3.
对于不可等待的情况证明了它是强NP-难的，并给出了动态规划算法和一个最坏情况界为5/3的近似算法。
The polynomials are derived from an original polynomial, which defines a feedback function of a linear feedback shift register capable for generating the pseudo random number.
这些多项式是从原始多项式导出的，该原始多项式定义了能够生成伪随机数的线性反馈移位寄存器的反馈函数。
Pseudo random sequence plays a very important role in modern communication technology. The paper to establish pseudo random sequence to realize primitive polynomial.
伪随机序列在现代通信技术中有着非常重要的作用，其技术关键是实现本原多项式。
Based on the pseudo-division algorithm for multivariate matrix polynomials, a new solving process of characteristic series for algebraic polynomial systems is given.
基于矩阵多元多项式的带余除法，给出了代数情形多项式组特征列的一种新求法，并举例验证了这种方法的有效性。
Based on the pseudo-division algorithm for multivariate matrix polynomials, a new solving process of characteristic series for algebraic polynomial systems is given.
基于矩阵多元多项式的带余除法，给出了代数情形多项式组特征列的一种新求法，并举例验证了这种方法的有效性。
应用推荐