Vidyalelo
Data Structure · Q1169

Miscellaneous on Data Structures

Programming · Data Structure · question 1169

Q1169

How many conditions have to be met if an NP- complete problem is polynomially reducible?

A.
1
B.
2
Answer
C.
3
D.
4

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board