Huo Xizhen. Topological Analysis of Network Sensitivity and Time Complexity of Algorithm[J]. Acta Electronica Sinica, 1992, (2): 92-95.DOI:
Topological Analysis of Network Sensitivity and Time Complexity of Algorithm
摘要
本文导出了网络灵敏度的拓扑公式
编制了计算机程序
并用它求解有源网络的灵敏度。着重证明了K-树组法为多项式时间复杂性算法。
Abstract
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.