本文对线性选择算法在比较算法类中给出了基于中值序列而设计的任何改进算法的复杂度下界；
The lower bound of worst complexity is presented for any improved BFPET selecting algorithm based on median sequence.
对一些特定图的拉普拉斯特征值的能量的上下界及大小进行比较，并给出了新的上下界。
Comparison the upper and lower bounds and its sector of the Laplace energy for some specific graphs, and then we gives some new upper and lower bounds for these graphs.
应用推荐