Last Updated：2025/11/23
Sentence
与えられたグラフがハミルトン閉路を持つかどうかを判定する問題は、NP完全（非決定性多項式時間に属し、かつNP困難である）であり、大規模なインスタンスでは手に負えないままである。
Quizzes for review
Determining whether a given graph has a Hamiltonian cycle is an NP-complete problem that remains intractable for large instances.
See correct answer
Determining whether a given graph has a Hamiltonian cycle is an NP-complete problem that remains intractable for large instances.
音声機能が動作しない場合はこちらをご確認ください
Related words
NP-complete
Adjective
not-comparable
of a decision problem
Japanese Meaning
NP完全問題：計算理論において、ある決定問題が、非決定性チューリング機械で多項式時間内に解けるNP問題であり、かつ全てのNP問題が多項式時間内に還元可能なNP困難な問題であることを示す。
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
