Question
In a computational complexity theory, a problem with decision making is said to be NP-complete when it is both in NP and NP-hard. What does NP mean?
Answer: Option C
Was this answer helpful ?
Although any given solution to an NP-complete problem can be validated quickly in polynomial time; there is no way to efficiently locate a solution to begin with. The unique characteristic of NP-complete problems is that no fast solution to them is known and hence NP-complete problems are said to be non-deterministic polynomial time.
Was this answer helpful ?
More Questions on This Topic :
Latest Videos
Latest Test Papers
Submit Solution