| 网络灵敏度的拓扑分析和算法的时间复杂度 |
| |
| 引用本文： | 霍锡真. 网络灵敏度的拓扑分析和算法的时间复杂度[J]. 电子学报, 1992, 20(2): 92-95 |
| |
| 作者姓名： | 霍锡真 |
| |
| 作者单位： | 北京邮电学院 北京 |
| |
| 摘 要： | 本文导出了网络灵敏度的拓扑公式,编制了计算机程序,并用它求解有源网络的灵敏度。着重证明了K-树组法为多项式时间复杂性算法。
|
| 关 键 词： | 灵敏度 K－树组 复杂度 网络 计算机 |
Topological Analysis of Network Sensitivity and Time Complexity of Algorithm |
| |
| Huo Xizhen. Topological Analysis of Network Sensitivity and Time Complexity of Algorithm[J]. Acta Electronica Sinica, 1992, 20(2): 92-95 |
| |
| Authors: | Huo Xizhen |
| |
| 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. |
| |
| Keywords: | Sensitivity K-tree term Time complexity |
| 本文献已被 CNKI 维普 等数据库收录！ |
