Decision problem

In computational complexity theory, decision problems are those with only two possible solutions: a yes-answer and a no-answer. More formally, a decision problem $\Pi$ has a set $D_{\Pi }$ of instances, and a subset $Y_{\Pi }\subset D_{\Pi }$ of yes-instances.