TFNP
In computational complexity theory , the complexity class TFNP is the class of total function problems which can be solved in nondeterministic polynomial time . 
<triplet> complexity class <subj> computational complexity theory <obj> part of <triplet> TFNP <subj> complexity class <obj> instance of