摘要
分析了影响动态规划算法时间复杂度的3个因素,分别从3个方面给出了改进动态规划算法时间复杂度的优化措施,从理论上分析了优化方法的有效性和正确性.与传统算法相比,优化后的算法时间复杂度有一定程度的提高,能够适用于数据规模更大的问题.
In this paper, we tried to optimize the dynamic programming algorithm in three aspects of time complexity , proposed the measures to improve time efficiency , and analyzed the validity and correctness of measures in theory . Compared with the traditional algorithm , the time complexity of the optimized algorithm is improved to a certain extent , and the dynamic programming is fitted for the problem with large-size data.
出处
《中南民族大学学报（自然科学版）》
CAS
北大核心
2016年第2期135-140,共6页
Journal of South-Central University for Nationalities：Natural Science Edition
基金
国家自然科学基金资助项目(61379059)
关键词
动态规划
时间效率
优化
dynamic programming
time efficiency
optimization
