A note on the complexity of addition

06/14/2023
by   Emil Jeřábek, et al.
0

We show that the sum of a sequence of integers can be computed in linear time on a Turing machine. In particular, the most obvious algorithm for this problem, which appears to require quadratic time due to carry propagation, actually runs in linear time by amortized analysis.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset