| 单词 | Bit Complexity |
| 释义 | Bit ComplexityThe number of single operations (of Addition, Subtraction, and Multiplication) requiredto complete an algorithm. See also Strassen Formulas
Borodin, A. and Munro, I. The Computational Complexity of Algebraic and Numeric Problems. New York: American Elsevier, 1975. |
| 随便看 |
|
数学辞典收录了8975条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。