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. These is no known algorithm which can calculate on optimal addition chain for a given number with any guarantees of reasonable ti...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book Section |
| Language: | English English English |
| Published: |
Springer
2019
|
| Subjects: | |
| Online Access: | http://eprints.unisza.edu.my/3997/1/FH05-FIK-19-22883.pdf http://eprints.unisza.edu.my/3997/2/FH05-FIK-19-22884.pdf http://eprints.unisza.edu.my/3997/3/FH05-FIK-19-22887.pdf http://eprints.unisza.edu.my/3997/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|