Why are you assuming exponentiation is constant time? For machine integers it ne...

		bidirectional on April 25, 2021 \| parent \| context \| favorite \| on: Dynamic Programming vs. Divide-and-Conquer (2018) Why are you assuming exponentiation is constant time? For machine integers it near-enough is, but there are fewer than 100 Fibonacci numbers that fit in a 64-bit integer so you may as well use a lookup table. For arbitrary precision integers it definitely isn't.