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?
A. Non Polynomial time
B. Non-deterministic Probabilistic
C. Non-deterministic Polynomial time
D. Non Probabilistic time
Answer: Option C
This Question Belongs to Data Structure >> Sorting Algorithms
Join The Discussion