A problem is said to be NP-hard if :
Guiding State PSC aspirants since 2016 50,000+ students · 1,000+ final selections Exam Calendar Results Call 9116926003
pscnotes
Pick your state
TPSC Prelims previous year questions

A problem is said to be NP-hard if :

Asked in TPSC Junior System Engineer 2026

  1. It can be solved in polynomial time
  2. Every NP problem can be reduced to it in polynomial time
  3. It belongs to the class P
  4. It can be verified in polynomial time

Answer under review: our editors are checking this question. Try the other TPSC Prelims previous year questions questions meanwhile.

More TPSC Prelims previous year questions questions

All 772 TPSC Prelims previous year questions questions →