Efficient generation of shortest addition-multiplication chains (Q5220293)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7180434
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient generation of shortest addition-multiplication chains |
scientific article; zbMATH DE number 7180434 |
Statements
EFFICIENT GENERATION OF SHORTEST ADDITION-MULTIPLICATION CHAINS (English)
0 references
16 March 2020
0 references
addition chain
0 references
addition-multiplication chain
0 references
branch-and-bound algorithm
0 references
bounding sequence
0 references
0.8426865935325623
0 references
0.8256369233131409
0 references
0.8224045038223267
0 references
0.8094533681869507
0 references
