Question 27
Let S be an NP-complete problem. Q and R are other two problems not known to be NP. Q is polynomial time reducible to S and S is polynomial time reducible to R. Which of the
following statements is true?
Create a FREE account and get:
- Download Maths Shortcuts PDF
- Get 300+ previous papers with solutions PDF
- 500+ Online Tests for Free
Book Free CAT Mentorship
Get personalized CAT strategy from a 99%iler
500+ students mentored
OTP Verification
Enter the 6-digit code sent to your phone
Booking Summary
Session:Free CAT Mentorship
Phone:
Date:
Time:
Enter OTP
Didn't receive the OTP?
