# Function problem

In computational complexity theory, a function problem is a computational problem where a single output (of a total function) is expected for every input, but the output is more complex than that of a decision problem, that is, it isn't just YES or NO.

## Examples

A well-known function problem is given by the Functional Boolean Satisfyability Problem, FSAT for short. The problem, which is closely related to the SAT decision problem can be formulated as follows:

In this case the relation $R(x,y)$ is given by tuples of suitably encoded boolean formulas and satisfying assignments.

Other notable examples include the travelling salesman problem, which asks for the route taken by the salesman, and the integer factorization problem, which asks for the list of factors.

## Relationship to other complexity classes

Consider an arbitrary decision problem in the class NP. By definition each problem instance $x$ which are answered 'yes' have a certificate $y$ which servers as a proof for the 'yes' answer. Thus, the set of these tuples $(x,y)$ forms a relation. The complexity class derived from this transformation is denoted by $\mathbf {F} (\mathbf {NP} )$ or FNP for short. The mapping of the complexity class P is denoted by FP. The class FP is the set of function problems which can be solved by a deterministic Turing machine in polynomial time, whereas FNP is the set of function problems which can be solved by a non-deterministic Turing machine in polynomial time.

## Self-reducibility

Observe that the problem FSAT introduced above can be solved using only polynomially many calls to a subroutine which decides the SAT problem: An algorithm can first ask whether the formula $\varphi$ is satisfiable. After that the algorithm can fix variable $x_{1}$ to TRUE and ask again. If the resulting formula is still satisfiable the algorithm keeps $x_{1}$ fixed to TRUE and continues to fix $x_{2}$ , otherwise it decides that $x_{1}$ has to be FALSE and continues. Thus, FSAT is solvable in polynomial time using an oracle deciding SAT. In general, a problem in NP is called self-reducible if its function variant can be solved in polynomial time using an oracle deciding the original problem. Every NP-complete problem is self-reducible. It is conjectured that the integer factorization problem is not self-reducible.

## Reductions and complete problems

It is therefore possible to define FNP-complete problems analogous to the NP-complete problem:

A problem $\Pi _{R}$ is FNP-complete if every problem in FNP can be reduced to $\Pi _{R}$ . The complexity class of FNP-complete problems is denoted by FNP-C or FNPC. It coincides with $\mathbf {F} (\mathbf {NP} )$ . Hence the problem FSAT is also an FNP-complete problem, and it holds that $\mathbf {P} =\mathbf {NP}$ if and only if $\mathbf {FP} =\mathbf {FNP}$ .

## Total function problems

The relation $R(x,y)$ used to define function problems has the drawback of being incomplete: Not every input $x$ has a counterpart $y$ such that $(x,y)\in R$ . Therefore the question of computability of proofs is not separated from the question of their existence. To overcome this problem it is convenient to consider the restriction of function problems to total relations yielding the class TFNP as a subclass of FNP. This class contains problems such as the computation of pure Nash equilibria in certain strategic games where a solution is guaranteed to exist. It has been shown that $\mathbf {TFNP} =\mathbf {F} (\mathbf {NP} \cap {\textbf {co-NP}})$ . In addition, if TFNP contains any FNP-complete problem it follows that $\mathbf {NP} ={\textbf {co-NP}}$ .