[complexity] In computational complexity theory, the complexity class FNP is the function problem extension of the decision problem class NP. The name is somewhat of a misnomer, since technically it is a class of binary relations, not functions, as the following formal definition explains: This definition does not involve nondeterminism and... Found on http://en.wikipedia.org/wiki/FNP_(complexity)