Last Updated：2025/12/01
Sentence
ある問題がNP完全であることを示すには、既知のNP完全問題から多項式時間の多対一還元を構成する必要があることが多い。
Quizzes for review
Proving a problem NP-complete often requires constructing a Karp reduction from a known NP-complete problem.
See correct answer
Proving a problem NP-complete often requires constructing a Karp reduction from a known NP-complete problem.
音声機能が動作しない場合はこちらをご確認ください
Related words
Karp reduction
Noun
countable
uncountable
Japanese Meaning
カルプ還元：計算理論において、ある問題の入力を多項式時間アルゴリズムを用いて別の問題の入力に変換し、変換後の問題の出力が元の問題の出力と一致するようにする手法。また、問題の難易度の比較やNP完全性の証明に利用される。
Related Words
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
