- A.
- B.
- C.
- D.
Studying seriously for GATE CSE?
Keep browsing free. Pro unlocks the paid study loop: explanations, topic mastery, mistake notebook, and custom PYQ drills.
See GATE CSE betaOpen notebookGATE 20032003PYQMCQanswer keyexplanation sooneasy
Algorithms · Complexity Classes
Concept intelligence
Jump into a concept drill from this question.
Recurring concept
See all 6 →Complexity Classes has appeared in GATE CSE & IT 6 times across 6 years (2003, 2004, 2006, 2009, 2015, ...).
More questions on Complexity Classes
See all →- 2015 QLanguage $${L_1}$$ is polynomial time reducible to language $${L_2}$$ . Language $${L_3}$$ is polynomial time...
- 2009 QLet $${\pi _A}$$ be a problem that belongs to the class NP. Then which one of the following is TRUE?
- 2006 QLet S be an NP-complete problem and Q and R be two other problems not known to be in NP. Q is polynomial time...
- 2004 QThe problems 3-SAT and 2-SAT are
- 1992 QWhich of the following problems is not NP-hard?
NP-completepolynomial reductioncomplexity classes