An Algorithm for Computing Optimal Exponent Pairs

DOI10.1112/JLMS/S2-33.2.203MaRDI QIDQ5184976zbMATH OpenOpenAlexFDO

Authors Sidney W. Graham

Publication date 1986

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms/s2-33.2.203

zbMATH Keywords

algorithmarithmetic applicationsexponent pairstwo dimensional exponent pairs

Mathematics Subject Classification ID

Estimates on character sums (11L40)

Recommendations

• Efficient implementation of algorithms for approximate exponentiation
• scientific article; zbMATH DE number 2085203
• Exponent Recoding and Regular Exponentiation Algorithms
• Algorithms for exponentiation in finite fields
• Efficient and optimal exponentiation in finite fields
• A stable algorithm for matrix exponent calculation
• scientific article; zbMATH DE number 3879021
• The complexity of computing exponents

Cited in

(10)

• On the mean-square of the Riemann zeta-function on the critical line
• scientific article; zbMATH DE number 3879021 (Why is no real title available?)
• Exponent Recoding and Regular Exponentiation Algorithms
• Piatetski-Shapiro primes from almost primes
• scientific article; zbMATH DE number 1303124 (Why is no real title available?)
• Linear programming over exponent pairs
• An Upgrading Algorithm With Optimal Power Law
• Small solutions of generic ternary quadratic congruences
• Toward optimal exponent pairs
• Short interval results for squarefree numbers

This page was built for publication: An Algorithm for Computing Optimal Exponent Pairs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5184976)