Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
FNP (complexity)
open-in-new
<p>In <a href="/facts/Computational_complexity_theory/etHuVF3U">computational complexity theory</a>, the <a href="/facts/Complexity_class/IIKrcTbP">complexity class</a> FNP is the <a href="/facts/Function_problem/3zPWpraL">function problem</a> extension of the <a href="/facts/Decision_problem/cQNWjbdE">decision problem</a> class <a href="/facts/NP_(complexity)/6muUfVMI">NP</a>. The name is somewhat of a misnomer, since technically it is a class of <a href="/facts/Binary_relation/r9BwGgaK">binary relations</a>, not functions, as the following formal definition explains: </p> A binary relation P(<i>x</i>,<i>y</i>), where <i>y</i> is at most polynomially longer than <i>x</i>, is in FNP if and only if there is a deterministic polynomial time algorithm that can determine whether P(<i>x</i>,<i>y</i>) holds given both <i>x</i> and <i>y</i>.<a class="footnote-ref" id="fnref:1" href="#fn:1"><sup>1</sup></a> <p>This definition does not involve nondeterminism and is analogous to the verifier definition of NP. </p><p>There is an NP language directly corresponding to every FNP relation, sometimes called the decision problem <i>induced by</i> or <i>corresponding to</i> said FNP relation. It is the language formed by taking all the <i>x</i> for which P(<i>x</i>,<i>y</i>) holds given some <i>y</i>; however, there may be more than one FNP relation for a particular decision problem. </p><p>Many problems in NP, including many <a href="/facts/NP-complete/NFPv56DU">NP-complete</a> problems, ask whether a particular object exists, such as a satisfying assignment, a <a href="/facts/Graph_coloring/J6HoBfP0">graph coloring</a>, or a clique of a certain size. These problems often correspond to problems in FNP that ask not only whether an object exists but what value or values such an object can have. When a FNP problem corresponds in this way to an NP-complete problem, it is <a href="/facts/NP-hard/mQeNPv4R">NP-hard</a>. Bellare and Goldwasser showed in 1994 using some standard assumptions that there exist problems in NP such that their FNP versions are not <a href="/facts/Self-reducibility/3zPWpraL">self-reducible</a>, implying that they are harder than their corresponding decision problem. </p><p>For each P(<i>x</i>,<i>y</i>) in FNP, the search problem associated with P(<i>x</i>,<i>y</i>) is: given <i>x</i>, find a <i>y</i> such that P(<i>x</i>,<i>y</i>) holds, or state that no such <i>y</i> exists. The search problem for every relation in FNP can be solved in polynomial time if and only if <a href="/facts/P_%253D_NP_problem/xoC7Ruda">P = NP</a>. This result is usually stated as "<a href="/facts/FP_(complexity)/FSK2uwKz">FP</a> = FNP if and only if <a href="/facts/P_%253D_NP_problem/xoC7Ruda">P = NP</a>"; however, for this statement to be true, it is necessary to redefine FP and FNP so that the members of FP and FNP are not relations, but are instead search problems associated with relations. </p>