In this paper, some preliminaries about signal flow graph, linear time-invariant system on F(z) and computational complexity are first introduced in detail. In order to synthesize the necessary and sufficient condition on F(z) for a general 2-path problem, the sufficient condition on F(z) or R and necessary conditions on F(z) for a general 2-path problem are secondly analyzed respectively. Moreover, an equivalent sufficient and necessary condition on R whether there exists a general 2-path is deduced in detail. Finally, the computational complexity of the algorithm for this equivalent sufficient and necessary condition is introduced so that it means that the general 2-path problem is a P problem.
翻译：本文首先详细介绍一些关于信号流图、F(z)和计算复杂度的线性时间变异系统的初步材料,为了综合F(z)对一般的二病症问题的必要和充分条件,将分别分析F(z)或R的充分条件和F(z)对一般的二病症问题的必要条件;此外,详细推断R是否存在一般的二病症的同等必要条件的足够和必要条件。最后,引入这一等同的足够和必要条件的算法的计算复杂性,从而意味着一般的二病症问题是一个P问题。
相关内容
微信扫码咨询专知VIP会员