When min (F n , G m , α) = 0, algorithm A is stochastically dominant over B.
if min (F n , G m , α) ≥ 0.5, then F is not almost stochastically larger than G (with confidence level 1 − α) and hence we should accept the null hypothesis that algorithm A is not superior to algorithm B. del Barrio et al.