Computer Science · Theory of Computation
A decision problem is defined to be in NP-complete if:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1It has no verification algorithm
- 2It cannot be verified in polynomial time
- 3It can be solved in deterministic polynomial time
- 4It is in NP and every problem in NP can be reduced to it in polynomial time✓
Correct answer
It is in NP and every problem in NP can be reduced to it in polynomial time
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