Name
Abstract | ||
|---|---|---|
An addition sequence problem is given a set of numbers X = fn1;n2;¢¢¢;nmg; what is the minimal number of additions needed to compute all m numbers starting from 1? Downey et al. (9) showed that the addition sequence problem is NP- complete. This problem has application in evaluating the monomials yn 1 ;yn 2 ;¢¢¢;yn m : In this paper, we present an algorithm to generate an addition sequence with minimal number of elements. We generalize some results on addition chain(m = 1) to addition sequence to speed up the computation. |
Year | Venue | Keywords |
|---|---|---|
2006 | FCS | vec- torial addition chain,addition sequence,addition chain,monomials evaluation,branch and bound algorithm.,branch and bound algorithm |
Field | DocType | Citations |
Discrete mathematics,Branch and bound,Combinatorics,Monomial,Mathematics,Computation,Addition chain,Speedup | Conference | 1 |
PageRank | References | Authors |
0.36 | 14 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hatem M. Bahig | 1 | 23 | 7.53 |
| Hazem M. Bahig | 2 | 24 | 7.61 |