🎴 Flashcard Mode
Computer Science (UGC/NET)
Card1 / 15
Mastered0
Review0
QuestionClick to flip
Which of the following problems is not considered to be in NP-complete?
AnswerClick to flip back
A
graph isomorphism
💡 Explanation:
The graph isomorphism problem is suspected to be neither in P nor NP-complete, though it is in NP. This is an example of a problem that is thought to be hard, but is not thought to be NP-complete.