The number of single operations (of addition, subtraction, and multiplication) required to complete an algorithm.
Bit Complexity
See also
Strassen FormulasExplore with Wolfram|Alpha
References
Borodin, A. and Munro, I. The Computational Complexity of Algebraic and Numeric Problems. New York: American Elsevier, 1975.Referenced on Wolfram|Alpha
Bit ComplexityCite this as:
Weisstein, Eric W. "Bit Complexity." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/BitComplexity.html