scientific article; zbMATH DE number 903721

zbMath0865.11085MaRDI QIDQ4885335

Carl B. Pomerance

Publication date: 15 July 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

multiplicative independenceanalysis of factoring algorithmssequence of random integers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Related Items (4)

The sharp threshold for making squares ⋮ Running Time Predictions for Factoring Algorithms ⋮ On testing for zero polynomials by a set of points with bounded precision. ⋮ On sharp transitions in making squares

This page was built for publication: