scientific article; zbMATH DE number 903721

MaRDI QIDQ4885335zbMATH OpenFDO

Authors Carl Pomerance

Publication date 15 July 1996

zbMATH Keywords

analysis of factoring algorithmsmultiplicative independencesequence of random integers

Mathematics Subject Classification ID

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

Recommendations

• On sharp transitions in making squares
• scientific article; zbMATH DE number 849975
• On mean values of random multiplicative functions
• On consecutive values of random completely multiplicative functions

Cited in

(6)

• On testing for zero polynomials by a set of points with bounded precision.
• The sharp threshold for making squares
• Running Time Predictions for Factoring Algorithms
• On sharp transitions in making squares
• scientific article; zbMATH DE number 849975 (Why is no real title available?)
• scientific article; zbMATH DE number 5262130 (Why is no real title available?)

This page was built for publication:

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