Performance comparison of some addition chain methods based on integer family
A generalized version of an addition chain problem, in which one must find a chain that simultaneously satisfies a sequence on integer in ascending order, is NP-complete. There is no known algorithm which can calculate an optimal addition chain for a given number with any guarantees of reasonable ti...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Conference Paper |
| Language: | English |
| Published: |
2020
|
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Tenaga Nasional |
| Language: | English |