Indexed by：
Abstract：
The computational aspects of finding the shortest addition chains for an integer are investigated in this work. Theoretically developed lower and upper bounds for the minimal length of the addition chains for an integer are exploited to construct a subtle pruning function for backtracking algorithm. These techniques are finally combined to build an efficient algorithm for finding the optimal addition chains. © 2013 Universitas Ahmad Dahlan.
Keyword：
Reprint 's Address：
Email：
Source ：
Telkomnika - Indonesian Journal of Electrical Engineering
ISSN： 2302-4046
Year： 2013
Issue： 11
Volume： 11
Page： 6447-6453
Cited Count：
WoS CC Cited Count： 0
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 2
Affiliated Colleges：
