In algorithmic analysis, little-o notation is used to quantitatively state that one function grows strictly slower than another function.
