![]() |
|
|
| |
|
||||
In mathematics, addition chain exponentiation is a fast method of exponentation. It works by creating a minimal-length addition chain that generates the desired exponent. Each exponentiation in the chain can be evaluated by multiplying two of the earlier exponentiation results. This algorithm works better than binary exponentiation for high exponents. It trades off space for speed, so it may not be good on overworked systems.
|
|
|
|
|
|
|
|
Copyright 2008 WordIQ.com - Privacy Policy
::
Terms of Use
:: Contact Us
:: About Us This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Addition chain exponentiation". |