Bit Complexity

The number of single operations (of addition, subtraction, and multiplication) required to complete an algorithm.

See also

Strassen Formulas

Explore with Wolfram|Alpha

More things to try:

References

Borodin, A. and Munro, I. The Computational Complexity of Algebraic and Numeric Problems. New York: American Elsevier, 1975.

Referenced on Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Bit Complexity." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/BitComplexity.html

Subject classifications