Computer Science · Complexity Theory
Let S be an NP-Complete problem, and let Q and R be two other decision problems. Q is polynomial-time reducible to S (Q ≤p S) and S is polynomial-time reducible to R (S ≤p R). Which of the following statements MUST be true?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1R is NP-Complete
- 2R is NP-Hard✓
- 3Q is NP-Complete
- 4Q is NP-Hard
Correct answer
R is NP-Hard
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 Complexity Theory MCQs →Want more practice questions on Complexity Theory?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Complexity Theory