In computational complexity theory, the complexity class TFNP is the class of total function problems which can be solved in nondeterministic polynomial...

class introduced by Christos Papadimitriou in 1994. PPAD is a subclass of TFNP based on functions that can be shown to be total by a parity argument. The...

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...

games with simultaneous moves refereed deterministically in polynomial time TFNP Total function problems solvable in non-deterministic polynomial time. A...

Optimization problem Search problem Counting problem (complexity) Function problem TFNP "Promise problem". Complexity Zoo. Goldreich, Oded (2006). "On Promise Problems...

Introduced by Christos Papadimitriou in 1994 (page 528), PPA is a subclass of TFNP. It is a class of search problems that can be shown to be total by an application...

relation between FNP and FP is analogous to the relation between NP and P. TFNP is a subset of FNP: it contains those relations in FNP for which, for every...

related Blichfeldt's theorem, have been studied from the perspective of TFNP search problems. In particular, it is known that a computational analogue...

complexity class PPP (polynomial pigeonhole principle) is a subclass of TFNP. It is the class of search problems that can be shown to be total by an application...

functional versions of P and NP: FP ⊆ PLS ⊆ FNP. PLS also is a subclass of TFNP, that describes computational problems in which a solution is guaranteed...