Computer Science · Theory of Computation
If a decision problem is NP-complete, which of the following statements must be true?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1It cannot be verified in polynomial time.
- 2It is strictly harder than any problem in NP.
- 3It is in NP and every problem in NP is polynomial-time reducible to it.✓
- 4It cannot have a polynomial-time algorithm.
Correct answer
It is in NP and every problem in NP is polynomial-time reducible to it.
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Theory of Computation MCQs →Want more practice questions on Theory of Computation?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Theory of Computation