CAT 2024 Last Batch ๐งโ๐ Starts on Monday (22nd July). Enroll now
Edit MetaData
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 thefollowing statements is true?
R is NP-complete
R is NP-hard
Q is NP-complete
Q is NP-hard
Create a FREE account and get:
Login to your Cracku account.
Follow us on
Incase of any issue contact support@cracku.in
Boost your Prep!
Detailed syllabus & Topic-wise Weightage
By proceeding you agree to create your account
Free CAT Syllabus PDF will be sent to your email address soon !!!