A decision problem asks for one of two answers, conventionally encoded as zero and one. Equivalently, it asks whether an input belongs to a formal language.
A search problem asks for a witness satisfying a specified relation rather than only whether one exists.
Articles by others on the same topic
A computational problem refers to a task that can be formalized in terms of inputs, outputs, and a specific method or algorithm to transform the inputs into the outputs. In more technical terms, a computational problem consists of defining a set of instances, where each instance is associated with a specific input, and specifying the desired output for those inputs.
