“背包问题”算法设计及分析

The Design and Analysis of the Knapsack Program's Algorithms

随着网络技术的不断发展,网络安全中有关密码技术的应用作为有效可行的方法倍受网络开发人员的青睐,背包公钥密码在电子商务中的公钥设计中具有其它技术不可替代的作用。因此,“背包问题”求解也是算法设计及验证的一个热点,本文分别采用了优先策略、动态规划及递归三种不同方法对“背包问题”进行求解、算法设计及验证,文中较详细的描述其设计思想,并分析了各种算法实现的复杂度问题。

With the development of the network technology, many network exploiting people are in favor of relating secret code technology which is on effective available method in network security, then backpack public password has its especial function in the public key design of the E-commerce. Therefore, the solution to the 揵ackpack issue ?becomes a hotspot in the arithmetic design. There are solution,arithmetic designing and validity to the 揵ackpack issue ?with prior strategy, dynamic programming and recursion in this book in which there is detailed description of its designing antilogy and analysis of complexity of all kinds of arithmetic realizations.