In a computational complexity theory, a problem with decision making is said to be NP-complete when it is both in NP and
Posted: Wed Jul 13, 2022 6:15 pm
a) Non Polynomial time
b) Non-deterministic Probabilistic
c) Non-deterministic Polynomial time
d) Non Probabilistic time
b) Non-deterministic Probabilistic
c) Non-deterministic Polynomial time
d) Non Probabilistic time