TL;DR: A systematic recurrence for a martingale on a computational tree leads to explicit and interpretable bounds with nonlinear terms controlled explicitly rather than by big-O terms, which yields new deterministic and probabilistic error bounds for three classes of mono-precision algorithms. (via Semantic Scholar)