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: | , , , , |
|---|---|
| 格式: | Conference Paper |
| 语言: | English |
| 出版: |
2020
|
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|