ON THE USE OF THE CYCLOMATIC NUMBER TO MEASURE PROGRAM COMPLEXITY.

被引：0

|

作者：

Elshoff, James L.

Marcotty, Michael

机构：

来源：

| 1978年

关键词：

Compendex;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

COMPUTER PROGRAMMING

引用

收藏

相关论文

共 21 条

[1] MEASURES OF PROGRAMMING COMPLEXITY.
Kitchenham, Barbara A.
ICL technical journal, 1981, 2 (03): : 298 - 316
[2] HOW TO APPLY COMPLEXITY.
Nelson, W.L.
1600, (74):
[3] NOTE ON THE LAW OF ITERATED LOGARITHM FROM THE VIEWPOINT OF KOLMOGOROV PROGRAM COMPLEXITY.
Kramosil, I.
Sindelar, J.
1600, (16):
[4] HIGH RELIABILITY THROUGH CHIP COMPLEXITY.
Hilibrand, Jack
Anderson, Kenneth R.
RCA Engineer, 1980, 25 (04): : 22 - 26
[5] Eigenvalue multiplicity of graphs with given cyclomatic number and given number of quasi-pendant vertices
Zhen, Wenhao
Wong, Dein
Zhang, Yuanshuai
Discrete Applied Mathematics, 2024, 347 : 23 - 29
[6] AUTONOMOUS ANTITONE SEQUENTIAL CIRCUITS - 4. ESTIMATES OF THE COMPLEXITY.
Starodubtsev, N.A.
1600, (20):
[7] POWER-FET AMPLIFIER DESIGNS BOOST FIDELITY, REDUCE COMPLEXITY.
Harvey, Barry
EDN, 1980, 25 (17) : 137 - 142
[8] PROGRAM TO CALCULATE THE GAMM MEASURE
WICHMANN, BA
DUCROZ, J
COMPUTER JOURNAL, 1979, 22 (04) : 317 - 322
[9] Improvement of statistical complexity to measure the complexities of two-dimensional arrays
Liu, Feng-Tao
He, Guo-Guang
Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology, 2009, 41 (10): : 150 - 153
[10] CHECKSUM-NUMBER ROUTINE ASSURES CORRECT PROGRAM ENTRY
GYLES, C
ELECTRONIC DESIGN, 1981, 29 (11) : 133 - 135