The complexity of number-theoretic constants

DOI10.1016/S0020-0190(97)00051-3zbMath1053.11544OpenAlexW2013169723MaRDI QIDQ1861411

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

Bernoulli numbersZeta functionComputational complexityArtin's constantTwin primes

Mathematics Subject Classification ID

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

Related Items (5)

A fast algorithm for computing the digamma function ⋮ A two-variable Artin conjecture ⋮ Computing prime harmonic sums ⋮ First-hit analysis of algorithms for computing quadratic irregularity ⋮ Computational strategies for the Riemann zeta function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Über die kleinste quadratfreie Zahl einer arithmetischen Reihe
• Fast evaluation of transcendental functions
• Fast evaluation of \(\zeta(3)\)
• Fast computation of the Riemann zeta-function \(\zeta (s)\) for integer values of the argument \(s\)
• Sieve algorithms for perfect power testing
• Two constants connected with the theory of prime numbers
• Irregular Primes and Cyclotomic Invariants to Four Million
• Evaluation of Artin's Constant and the Twin-Prime Constant
• Faster computation of Bernoulli numbers
• Irregular Primes to One Million
• Fast Multiple-Precision Evaluation of Elementary Functions
• Computation of Tangent, Euler, and Bernoulli Numbers
• On Artin's conjecture.
• Prime numbers and computer methods for factorization

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