| 程序设计中的复杂性问题 |
| |
| 引用本文： | 於崇定. 程序设计中的复杂性问题[J]. 南京邮电大学学报(自然科学版), 1987, 0(1) |
| |
| 作者姓名： | 於崇定 |
| |
| 摘 要： | 本文介绍复杂性理论在程序设计中的应用。程序设计不仅需要分析其空间复杂性,还应分析其时间复杂性。在一定的条件下,时间复杂性可换取空间复杂性,而空间复杂性也可换取时间复杂性,这就是时空互换原理。文中以具体例子论证了上述概念,并给出了程序设计中复杂性的计算公式和方法。
|
| 关 键 词： | 程序设计 复杂性理论 复杂性函数 时空互换 |
Complexity Problem in Programming |
| |
| Yu Chongding. Complexity Problem in Programming[J]. JJournal of Nanjing University of Posts and Telecommunications, 1987, 0(1) |
| |
| Authors: | Yu Chongding |
| |
| Affiliation: | Yu Chongding |
| |
| Abstract: | The complexity theory in programming is introduced. Programming needs not only toanalyze the space complexity but also the time complexity. Under certain condition the time complexity could be converted to the space complexity and vice versa, which is called the interchange principle of time complexity and space complexity. In this paper, we discuss the above concept with some examples, and show the formula and method to calculate the complexity in the programming. |
| |
| Keywords: | Programming Complexity theory Function of a complexity Time-Space converters |
| 本文献已被 CNKI 等数据库收录！ |
|
