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.