- Feb 7View Source
Kermit Rose wrote:
> Sometimes the complexity of the next algorithm up
> for the next higher power of 2
> is more than double the current algorithm.
Your "next algorithm" seems to be needed when the target
doubles, i.e when the number of bits increases by 1.
You say this costs more than double.
So the cost is (at least) exponential in the number of bits;
certainly not polynomial.