GATE | CS | 2014 | Set 3 | Discrete Mathematics | Logic | Question 56
Last Updated :
Discuss
Comments
Consider the decision problem 2CNFSAT defined as follows:
NP-Complete.
solvable in polynomial time by reduction to directed graph reachability.
solvable in constant time since any input instance is satisfiable.
NP-hard, but not NP-complete.
This question is part of this quiz :
Top MCQs on NP Complete Complexity with Answers,GATE-CS-2014-(Set-3)Share your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy