渐进时间复杂度
- 网络asymptotic time complexity
渐进时间复杂度-
并分析了该算法的收敛性及渐进时间复杂度；
Third , the convergence and supremum of the algorithm were proved , and the asymptotic time complexity was analyzed ;
-
详细阐述了离散标识法的原理、影响因素、自适应性离散步长的确定准则，分析了离散标识法快速支撑生成技术的渐进时间复杂度和空间复杂度。
This paper specifically demonstrates the discrete-marking principle , factors and the identified rule of self-adaptability discrete step criteria , and it also analyses the asymptotic time complexity and space complexity in auto-support generation algorithm based on discrete-marking method .