The complexity of number-theoretic constants

DOI10.1016/S0020-0190(97)00051-3MaRDI QIDQ1861411zbMATH OpenOpenAlexFDO

Authors Eric Bach

Publication date 19 March 2003

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(97)00051-3

zbMATH Keywords

Artin's constantBernoulli numbersComputational complexityTwin primesZeta function

Mathematics Subject Classification ID

Analytic computations (11Y35) Evaluation of number-theoretic constants (11Y60) Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Approximation of singular series and automata
• scientific article; zbMATH DE number 4077311
• A note on Artin's constant
• Numerical results on relations between fundamental constants using a new algorithm
• scientific article; zbMATH DE number 4095540

Cites work

• Computation of Tangent, Euler, and Bernoulli Numbers
• Evaluation of Artin's Constant and the Twin-Prime Constant
• Fast computation of the Riemann zeta-function \(\zeta (s)\) for integer values of the argument \(s\)
• Fast evaluation of \(\zeta(3)\)
• Fast evaluation of transcendental functions
• Fast Multiple-Precision Evaluation of Elementary Functions
• Faster computation of Bernoulli numbers
• scientific article; zbMATH DE number 3846865 (Why is no real title available?)
• scientific article; zbMATH DE number 3987351 (Why is no real title available?)
• scientific article; zbMATH DE number 3756556 (Why is no real title available?)
• scientific article; zbMATH DE number 55157 (Why is no real title available?)
• scientific article; zbMATH DE number 3309340 (Why is no real title available?)
• Irregular Primes and Cyclotomic Invariants to Four Million
• Irregular Primes to One Million
• On Artin's conjecture.
• Prime numbers and computer methods for factorization
• Sieve algorithms for perfect power testing
• Two constants connected with the theory of prime numbers
• Über die kleinste quadratfreie Zahl einer arithmetischen Reihe

Cited in

(8)

• Computational strategies for the Riemann zeta function
• Approximation of singular series and automata
• Computable irrational numbers with representations of surprising complexity
• A fast algorithm for computing the digamma function
• A note on Artin's constant
• Computing prime harmonic sums
• First-hit analysis of algorithms for computing quadratic irregularity
• A two-variable Artin conjecture

This page was built for publication: The complexity of number-theoretic constants

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