InterviewSolution
Saved Bookmarks
| 1. |
What is the full form of NP complexity?(a) Non-deterministic polynomial time(b) Non-linear polynomial time(c) Non-probabilistic polynomial time(d) Non-trainable polynomial timeI have been asked this question during an interview.This interesting question is from Architecture in division Cognitive Radio Architecture of Cognitive Radio |
|
Answer» The CORRECT option is (a) Non-deterministic polynomial time |
|