The class NP-complete designates problems that are both in NP (nondeterministic polynomial time) and NP-hard. A problem is classified as NP if a potential solution can be verified within polynomial time. It is NP-hard if every problem within NP can be transformed into it via a polynomial-time reduction. Consequently, NP-complete problems represent the most challenging problems within NP.
- Problems solvable in polynomial time (A) are categorized as P problems, not NP-complete problems.
- Problems requiring exponential time for resolution (C) is an inaccurate description of NP-complete problems. Although their worst-case solution time might be exponential, the defining characteristic is polynomial-time verifiability.
- Problems that cannot be solved by any algorithm (D) is false; NP-complete problems are solvable, though efficient solutions may not exist.
Therefore, the correct classification is (B), problems that are both NP-hard and belong to NP.