Bit complexity
= Bit complexity
The number of elementary operations on <bits> required by an <algorithm>. Arithmetic-operation counts treat operations on entire <integers> as units, whereas <bit complexity> charges for the sizes of their operands. An <algorithm> using few multiplications can therefore require substantially more bit operations when the operands grow. State the model when comparing bounds for <repeated squaring> or <dynamic programming> counts.