Q. To which of the following class does a CNF-satisfiability problem belong?

(A) np class
(B) p class
(C) np complete
(D) np hard

💬 Discuss

✅ Correct Answer: (C) np complete

Explanation: the cnf satisfiability problem belongs to np complete class. it deals with boolean expressions.

Published by Mr. Dubey ⭐ 111.42K Points at 16-Sep-2023 03:44 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

the cnf satisfiability problem belongs to np complete class. it deals with boolean expressions.

💬 Discussion

📊 Question Analytics

👁️

434

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

87%

Success Rate