2
$\begingroup$

Is there any known integer exponentiation algorithm to compute $x^y$ for the special case $x = 3$ which is faster than the general case algorithm found in [1], section 4.6.3?

[1] D. E. Knuth, The Art of Computer Programming. Volume 2: Seminumerical Algorithms, Addison-Wesley, 1981

  • 0
    @HenningMakholm: That's correct. The referenced Knuth's algorithm exploits the binary representation of the exponent, so let me clarify - I need the binary result to work with it in an ordinary binary computer.2011-11-27

0 Answers 0