| 算法复杂性函数渐近优超等价类的结构性质 |
| |
| 引用本文： | 张再跃. 算法复杂性函数渐近优超等价类的结构性质[J]. 软件学报, 1998, 9(4): 307-310 |
| |
| 作者姓名： | 张再跃 |
| |
| 作者单位： | 扬州大学数学与计算机科学系,扬州,225002 |
| |
| 基金项目： | 本文研究得到国家863高科技项目基金资助. |
| |
| 摘 要： | 本文建立了算法复杂性函数渐近优超等价类数学结构,并应用递归论研究中的方法和技巧对该结构的性质进行了系统的研究,证明了该结构具有强Friedberg-Muchnic性质和在偏序意义下的稠密性定理.
|
| 关 键 词： | 算法复杂性 渐近优超. |
| 收稿时间： | 1997-01-10 |
| 修稿时间： | 1997-05-15 |
Structure Properties about Asymptotically Dominating Equivalence Classes of Computational Complexity Functions |
| |
| ZHANG Zai-yue. Structure Properties about Asymptotically Dominating Equivalence Classes of Computational Complexity Functions[J]. Journal of Software, 1998, 9(4): 307-310 |
| |
| Authors: | ZHANG Zai-yue |
| |
| Affiliation: | Department of Mathematics and Computer Science Yangzhou University Yangzhou 225002 |
| |
| Abstract: | In this paper, the authors established a mathematical structure of asymptotically dominating equivalence classes of computational complexity functions and studied the properties of the structure systematically. Applying the methods and techniques of recursion theory to the study of this structure, they proved that the structure has strongly Friedberg-Muchnic property and is dense under the sense of partial ordering. |
| |
| Keywords: | Computational complexity asymptotically dominating. |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
