In this paper, we revise the graphical method by means of the Shortest path algorithm, and obtain two variants which are pseudo-polynomial algorithms.

本文利用最短路算法修订了图上作业法，得到了两个拟多项式算法。

youdao

Based on the pseudo-division algorithm for multivariate matrix polynomials, a new solving process of characteristic series for algebraic polynomial systems is given.

基于矩阵多元多项式的带余除法，给出了代数情形多项式组特征列的一种新求法，并举例验证了这种方法的有效性。

youdao

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的近似算法。

youdao

PROFESSOR: Great question. So the question is, how do you choose an algorithm, why would I choose to use a pseudo-polynomial algorithm when I don't know how big the solution is likely to be, I think that's one way to think about it.

教授：问得好，所以问题是，你怎样选择算法，为什么当我,不知道解决方案会有多大的时候,我要选伪多项式算法呢，我想这是一种思考问题的方式。

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