Question

What is the definition of an NP-hard problem?

A A problem that can be solved in polynomial time on non-deterministic Turing machines.
B A problem that is solvable in polynomial time on deterministic Turing machines.
C A problem that is at least as hard as the hardest problems in NP.
D A problem that is solvable using dynamic programming techniques.
E None of these
Practice Next

Hey! Ask a query

🎓
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
  • 200 Questions with Detailed Solutions
  • Section-wise Coverage (GA, English, Quant & Reasoning)