Paper Info
Title
Improved Generation of Minimal Addition Chains
Abstract
An addition chain for a natural number n is a sequence 1=a0a1a r=n of numbers such that for each 0i≤r, a i=a j+a k for some 0≤k≤ji. An improvement by a factor of 2 in the generation of all minimal (or one) addition chains is achieved by finding sufficient conditions for star steps, computing what we will call nonstar lower bound in a minimal addition and omitting the sorting step.
Year
DOI
Venue
2006
10.1007/s00607-006-0170-6
Computing
Keywords
DocType
Volume
sorting.,Improved Generation,sufficient condition,natural number n,branch and bound algorithm,addition chain,nonstar lower bound,Minimal Addition Chains,star step,minimal addition
Journal
78
Issue
ISSN
Citations 
2
1436-5057
4
PageRank 
References 
Authors
0.47
7
1
Name
Order
Citations
PageRank
Hatem M. Bahig1237.53