摘要
本文导出了网络灵敏度的拓扑公式,编制了计算机程序,并用它求解有源网络的灵敏度。着重证明了K-树组法为多项式时间复杂性算法。
In this paper, the topological formulation of network sensitivity is derived. A computerprogrom has been compiled and used to find the sensitivity of active network. It is proved that K-Tree Term method is a multinomial time complexity algorithm.
出处
《电子学报》
EI
CAS
CSCD
北大核心
1992年第2期92-95,共4页
Acta Electronica Sinica
