3 ms·
A selected excerpt from this paper: "The same should hold for Theorem 1, as will be discussed. We avoid the O(1) notation as far as possible, as it can be seve
by chronolitus 7y ago
A selected excerpt from this paper:
"The same should hold for Theorem 1, as will be discussed. We avoid the O(1) notation as far as possible, as it can be severely misleading (e.g. 10^42 = O(1)^O(1)) = O(1)).
This work could be viewed as another O() warning showing, how important factors, and even subdominant additive terms, are."
- riku_iki 7y agoO() is a notion of speed of growth, not measuring how large are constants.
- Chickenosaurus 7y agoRight, the critique is evaluating algorithms based solely on asymptotic time / space characteristics is insufficient. Constants can be significant if they are big enough.