FERT and FPERT are parameterized classes. FERT formally defined as the class of decision problems of the form (x, k), decidable in polynomial time by a probabilistic Turing Machine such that
Here, f is an arbitrary function (from the reals to <0,1/2]).
Defined in [KW15]. Contains BPP and is contained in para-PP and in FPERT.
FERT and FPERT are parameterized classes. FPERT is formally defined as the class of decision problems of the form (x, k1, k2), decidable in time f1(k1) * p(|x|) by a probabilistic Turing Machine such that
Here, f1 and f2 are arbitrary functions (f2 from the reals to <0,1/2]) and p is a polynomial.
Defined in [KW15]. Contains FERT and FPT and is contained in para-NPPP.