High Quality Content by WIKIPEDIA articles! In mathematics and computer science, optimal addition-chain exponentiation is a method of exponentiation by positive integer powers that requires a minimal number of multiplications. It works by creating a shortest addition chain that generates the desired exponent. Each exponentiation in the chain can be evaluated by multiplying two of the earlier exponentiation results. More generally, addition-chain exponentiation may also refer to exponentiation by non-minimal addition chains constructed by a variety of algorithms. The shortest addition-chain algorithm requires no more multiplications than binary exponentiation and usually less.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.