In fact, using the same idea we can show that the public coin certificate game complexity \(\mathsf {CG}^{\text{pub}}\)  is bounded above by randomized sabotage complexity \(\mathsf {RS}\) , a measure of complexity introduced to study the behaviour of randomized query complexity \(\mathsf {R}\)  under composition [1]}. It was shown that \(\mathsf {RS}\)  is a lower bound on \(R\)  and that it behaves perfectly under composition.
