翻訳と辞書 
knapsack problem ： FOLDOC  knapsack problem Given a set of items, each with a cost and a value, determine the number of each item to include in a collection so that the total cost is less than some given cost and the total value is as large as possible. The 0/1 knapsack problem restricts the number of each items to zero or one. Such constraint satisfaction problems are often solved using {dynamic programming}. The general knapsack problem is NPhard, and this has led to attempts to use it as the basis for publickey encryption systems. Several such attempts failed because the knapsack problems they produced were in fact solvable by {polynomialtime algorithms}. [Are there any trusted knapsackbased publickey cryptosystems?]. (19950410)
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース 
Copyright(C) kotoba.ne.jp 19972016. All Rights Reserved.

