In the mathematics of computational complexity theory, computability theory, and decision theory, a search problem is a type of computational problem represented by a binary relation. Intuitively, the problem consists in finding structure "y" in object "x". An algorithm is said to solve the problem if at least one corresponding structure exists, and then one occurrence of this structure is made output; otherwise, the algorithm stops with an appropriate output ("not found" or any message of the like).
Every search problem also has a corresponding decision problem, namely
L(R)=\{x\mid\existsyR(x,y)\}.
This definition may be generalized to n-ary relations using any suitable encoding which allows multiple strings to be compressed into one string (for instance by listing them consecutively with a delimiter).
More formally, a relation R can be viewed as a search problem, and a Turing machine which calculates R is also said to solve it. More formally, if R is a binary relation such that field(R) ⊆ Γ+ and T is a Turing machine, then T calculates R if:
(Note that the graph of a partial function is a binary relation, and if T calculates a partial function then there is at most one possible output.)
Such problems occur very frequently in graph theory and combinatorial optimization, for example, where searching for structures such as particular matchings, optional cliques, particular stable sets, etc. are subjects of interest.
A search problem is often characterized by:[1]
Find a solution when not given an algorithm to solve a problem, but only a specification of what a solution looks like.
Input: a graph, a set of start nodes, Boolean procedure goal(n) that tests if n is a goal node. frontier := ; while frontier is not empty: select and remove path