Running Time Predictions for Factoring Algorithms

DOI10.1007/978-3-540-79456-1_1zbMath1205.11132OpenAlexW1596420628MaRDI QIDQ3502724

Ernie Croot, Andrew Granville, Robin Pemantle, Prasad Tetali

Publication date: 27 May 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79456-1_1

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Related Items (1)

On sharp transitions in making squares

Cites Work

• On sharp transitions in making squares
• Enumerative problems inspired by Mayer's theory of cluster integrals
• Large character sums
• On Integers Free of Large Prime Factors
• The Multiple Polynomial Quadratic Sieve
• Asymptotically Fast Factorization of Integers
• Sharp thresholds of graph properties, and the $k$-sat problem
• Factoring with Two Large Primes
• Predicting the Sieving Effort for the Number Field Sieve
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Running Time Predictions for Factoring Algorithms