Pages that link to "Item:Q1340674"
From MaRDI portal
The following pages link to Efficient computation of addition chains (Q1340674):
Displaying 15 items.
- A new strategy for generating shortest addition sequences (Q644844) (← links)
- Calculating optimal addition chains (Q644848) (← links)
- Mechanically proving termination using polynomial interpretations (Q851142) (← links)
- Improved generation of minimal addition chains (Q854698) (← links)
- Efficient computation of addition chains (Q1340674) (← links)
- Accelerated shift-and-add algorithms (Q1577440) (← links)
- Addition chains, vector chains, and efficient computation (Q2214049) (← links)
- On a generalization of addition chains: addition-multiplication chains (Q2467743) (← links)
- Binary Addition Chain on EREW PRAM (Q3101432) (← links)
- (Q3308114) (← links)
- Effect of Improved Multiplication Efficiency on Exponentiation Algorithms Derived from Addition Chains (Q3747718) (← links)
- Computing special powers in finite fields (Q4813594) (← links)
- On-line evaluation of powers using Euclid's algorithm (Q4858842) (← links)
- Hensel-lifting torsion points on Jacobians and Galois representations (Q5216734) (← links)
- Addition Chains Meet Postage Stamps: Reducing the Number of Multiplications (Q5404377) (← links)