0 votes 0 votes _________ is the class of decision problems that can be solved by non-deterministic polynomial algorithms. $\text{NP}$ $\text{P}$ Hard Complete Others nielit2021dec-scientistb + – soujanyareddy13 asked Dec 7, 2021 edited Dec 14, 2021 by soujanyareddy13 soujanyareddy13 3.1k views answer comment Share Follow See 1 comment See all 1 1 comment reply raja11sep commented Dec 7, 2021 reply Follow Share Answer:A 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes option C :- It is NP . NP class deals with problems which can be solved in non deterministic polynomial algorithm. Ref: https://en.wikipedia.org/wiki/NP_(complexity) Kabir5454 answered Dec 7, 2021 Kabir5454 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes @Kabir5454 (A) NP … NP problems are called as non-deterministic polynomial problems... They are a class of decision problems that can be solved using NP algorithms… Bikram 1 answered Jul 13, 2022 Bikram 1 comment Share Follow See all 0 reply Please log in or register to add a comment.