时间复杂度

• As a result , it effectively reduces the transmission of information and the delay of propagation . its time complexity is ( m d logn )
  数值实验表明，这种算法是快速而有效的，算法的时间复杂度为( mdlogn ) 。
• At the same time , a fast heuristic algorithm of mimimum cost tree with delay constraint are presented , its time complexity is ( pn2 )
  同时还提出了一种满足延迟约束的多播最小生成树算法（时间复杂度为( pn2 ) ） 。
• Paper gives out an algorithm for seeking the set of intersection intervals . by it , the i - collede algor ithm is reduced to o ( nlogn )
  其中，提出了一种求相交线段集的算法，把原i ? collde算法时间复杂度降为o ( nlogn ) 。
• Incremental updating algorithm and parallel processing technology were used to raise the efficiency of data mining and reduce the time complexity
  由于使用了增量更新算法和并行处理技术，从而提高了数据挖掘的效率，降低了时间复杂度。
• The existing heuristics have high time complexity . the heuristics with simple , easy and distributed implementations are under research
  目前存在的启发式算法一般时间复杂度比较高，而简单容易且利于分布式实现的算法还处于研究之中。
• 1 milgram s . the small world problem . psychology today , 1967 , 61 : 60 - 67 . 2 albert r , jeong h , barabasi a l . the diameter of the world wide web
  据本文作者所知，目前最好的基于small world网络的路由算法只能达到o lg n 1 1 d的时间复杂度。
• So , computation in each dimension is feasible . this make the accuracy of cluster upgraded . but the computation complexity of the algorithm is still exponential
  只是这个指数是维数，使得算法的时间复杂度比起很多聚类算法的仍然简单很多。
• Using this method , we can extract several synthetic features to stand for the entire former information well , and can reduce the dimension greatly
  这种分词算法将分词和特征集缩减结合在一起，从而减少了特征缩减过程而使时间复杂度大大降低。
• At present , there is an algorithm for detecting rule set conflicts and its time complexity is o ( dn ) . however , this algorithm ’ s performance is very poor
  但是,目前存在的冲突检测算法,其时间复杂度为o ( dn ) ( n为规则个数, d为规则维数) ,效率低下。
• Simulation results show that our algorithms performed better in terms of cost compared with gtm algorithm and have the same time complexity ( p3n2 )
  对于带有多个约束的群播路由算法，由于其采用改进了的成本函数，算法的时间复杂度并没有增加，也为( p3n2 ) 。