Let P be a decision problem and INSTANCES(P) be set of all instances of P.
A certificate (relation) for P is a relation
R⊆INSTANCES(P)×STRINGS
where STRINGS is the set of all strings, such that:
I∈INSTANCES(P) positive⟺∃ certificate C∈STRING:(I,C)∈R