complexity analysis of algorithm 算法复杂度分析
The algorithm complexity analysis shows that, to a certain extent, the algorithm could resolve the NP hard problems of attributive value reduction.
通过算法复杂度分析说明，该算法在一定程度上解决了属性值约简的NP难问题。
The complexity analysis of the fixed window algorithm and the optimal length of window are also discussed.
最后给出了固定窗口算法的复杂性分析，并讨论了窗口宽度的最佳选取。
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.
理论分析和仿真表明该算法在保证估计精度的同时，可显著降低大频偏估计的计算复杂度。
应用推荐