一种根据决策树结合信息论的经典算法复杂度可能下界分析

周毅敏,李光耀

Analysis of Probable Lower Bound of Time Complexity of Some Classical Algorithms Based on Decision Tree and Information Theory

ZHOU Yi-min and LI Guang-yao

计算机科学 . 2013, (Z11): 238 -241 .