Based on the pseudo-division algorithm for multivariate matrix polynomials, a new solving process of characteristic series for algebraic polynomial systems is given.
基于矩阵多元多项式的带余除法，给出了代数情形多项式组特征列的一种新求法，并举例验证了这种方法的有效性。
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的近似算法。
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的近似算法。
应用推荐