用计算复杂度理论(Computational complexity theory) 来说，它平均需要 O(n2) 次运算。快速排序 (Quicksort) 是霍尔想到的第二个算法。
基于52个网页-相关网页
利用DNA合成技术、DNA克隆技术、PCR扩增技术以及DNA芯片技术，结合密码学的计算复杂度理论，提出了一种基于DNA技术的加密方法。
Using the technologies of DNA synthesis, DNA clone, PCR and DNA chip and the theory of computational complexity, an encryption scheme is formed.
理论分析和仿真表明该算法在保证估计精度的同时，可显著降低大频偏估计的计算复杂度。
Numerical analysis and simulations show that this algorithm reduces the computational complexity significantly for the estimation of large frequency offset while maintains a good performance.
目前的数学理论和计算实践显示，自然语言处理所需要的时间随输入信息的复杂度呈指数增长。
The current mathematic theory and calculation practices indicate that the time needed to process language information increases with the complexity of the input information exponentially.
应用推荐