「problem」の共起表現一覧(1語左が「decision」)
該当件数 : 12件
| The NP-completeness of the decision | problem can be shown using a reduction from the Hamil |
| The answer to the decision | problem is yes if this function f exists, and no othe |
| Since the decision | problem described above is NP-complete, this optimiza |
| This decision | problem is known to be NP-complete; it is one of Karp |
| The decision | problem of whether the Turing machine with index e wi |
| The decision | problem that asks whether a certain string s belongs |
| By the second definition, any decision | problem can be shown to be decidable by exhibiting an |
| to show that the general case of the decision | problem for first-order logic is unsolvable (see Chur |
| se problems are all hard: the clique decision | problem is NP-complete (one of Karp's 21 NP-complete |
| bgraph isomorphism is an NP-complete decision | problem that involves finding a given graph as an ind |
| The associated decision | problem, i.e., given G1, G2 and an integer k, decidin |
| plexity class NP in the sense that a decision | problem can be expressed in existential second-order |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|
検索履歴を保存できる！
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|
