info prev up next book cdrom email home

Bit Complexity

The number of single operations (of Addition, Subtraction, and Multiplication) required to complete an algorithm.

See also Strassen Formulas


References

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




© 1996-9 Eric W. Weisstein
1999-05-26