###
DOI:
Journal of Software:1998.9(4):307-310

算法复杂性函数渐近优超等价类的结构性质
张再跃
(扬州大学数学与计算机科学系,扬州,225002)
Structure Properties about Asymptotically Dominating Equivalence Classes of Computational Complexity Functions
ZHANG Zai-yue
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 3068   Download 2760
Received:January 10, 1997    Revised:May 15, 1997
> 中文摘要: 本文建立了算法复杂性函数渐近优超等价类数学结构,并应用递归论研究中的方法和技巧对该结构的性质进行了系统的研究,证明了该结构具有强Friedberg-Muchnic性质和在偏序意义下的稠密性定理.
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.
文章编号:     中图分类号:    文献标志码:
基金项目:本文研究得到国家863高科技项目基金资助. 本文研究得到国家863高科技项目基金资助.
Foundation items:
Reference text:

张再跃.算法复杂性函数渐近优超等价类的结构性质.软件学报,1998,9(4):307-310

ZHANG Zai-yue.Structure Properties about Asymptotically Dominating Equivalence Classes of Computational Complexity Functions.Journal of Software,1998,9(4):307-310