Decision problem
Theoretical computer science
A computational problem whose answer for each input is yes or no.
What is usually left out
Complexity classes such as P and NP are defined over decision problems specifically, which is why statements about them have to be phrased in those terms. It is rarely a real restriction: a search problem can usually be converted into a decision problem of comparable difficulty by asking whether a solution better than a given threshold exists.