Efficient implementation of algorithms for approximate exponentiation
From MaRDI portal
Publication:2380060
Recommendations
- Effect of Improved Multiplication Efficiency on Exponentiation Algorithms Derived from Addition Chains
- Computing partial information out of intractable: powers of algebraic numbers as an example
- scientific article; zbMATH DE number 177037
- Algorithms for computational precision
- scientific article; zbMATH DE number 2162686
Cites work
- Computing Sequences with Addition Chains
- Convergence Acceleration of Alternating Series
- scientific article; zbMATH DE number 3465382 (Why is no real title available?)
- scientific article; zbMATH DE number 520710 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 1929948 (Why is no real title available?)
Cited in
(8)- Computing partial information out of intractable: powers of algebraic numbers as an example
- Approximating \(x^ n\) efficiently
- Fast exponentiation using the truncation operation
- Fast modular multiplication based on complement representation and canonical recoding
- Exponent Recoding and Regular Exponentiation Algorithms
- Effect of Improved Multiplication Efficiency on Exponentiation Algorithms Derived from Addition Chains
- scientific article; zbMATH DE number 1929948 (Why is no real title available?)
- An Algorithm for Computing Optimal Exponent Pairs
This page was built for publication: Efficient implementation of algorithms for approximate exponentiation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380060)