Asymptotic semismoothness probabilities

DOI10.1090/S0025-5718-96-00775-2MaRDI QIDQ4718417zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Eric Bach, René Peralta

Publication date 3 December 1996

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/s0025-5718-96-00775-2

zbMATH Keywords

asymptotic probabilityfactoring algorithmsrecurrence relationssemismooth integerstables

Mathematics Subject Classification ID

Distribution of integers with specified multiplicative constraints (11N25) Factorization (11Y05) Values of arithmetic functions; tables (11Y70)

Recommendations

• Approximately counting semismooth integers
• On the number of semismooth integers
• scientific article; zbMATH DE number 849975
• Smooth numbers: computational number theory and beyond

Cites work

• A Differential Delay Equation Arising from the Sieve of Eratosthenes
• A Monte Carlo Factoring Algorithm With Linear Storage
• A Probabilistic Approach to a Differential-Difference Equation Arising in Analytic Number Theory
• AN EXAMPLE IN THE THEORY OF THE SPECTRUM OF A FUNCTION
• An FFT Extension to the P - 1 Factoring Algorithm
• Analysis of a simple factorization algorithm
• How to Generate Factored Random Numbers
• scientific article; zbMATH DE number 1003234 (Why is no real title available?)
• scientific article; zbMATH DE number 3064221 (Why is no real title available?)
• Integers free of large prime factors and the Riemann hypothesis
• Numbers with small prime factors, and the least 𝑘th power non-residue
• Numerical Solution of Some Classical Differential-Difference Equations
• On the distribution of points in a poisson dirichlet process
• On the First Occurrence of Values of a Character
• On the Numerical Solution of a Differential-Difference Equation Arising in Analytic Number Theory
• The number of positiv integers \(\leq x\) and free of prime divisors \(>x^c\), and a problem of S. S. Pillai

Cited in

(12)

• Exact asymptotics of positive solutions to Dickman equation
• Approximately counting semismooth integers
• A generic approach to searching for Jacobians
• Practical cryptanalysis of ISO 9796-2 and EMV signatures
• Approximating the number of integers without large prime factors
• Estimates of the number of integers with the special prime factorization. II
• A modification of an algorithm for estimating the cardinality of integers with no more than three prime divisors
• Оценки количества чисел со специальным разложением на простые множители
• Root optimization of polynomials in the number field sieve
• Optimal Parameterization of SNFS
• On the number of semismooth integers
• Trustless unknown-order groups

This page was built for publication: Asymptotic semismoothness probabilities

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