On sharp transitions in making squares
From MaRDI portal
Publication:431647
DOI10.4007/annals.2012.175.3.10zbMath1321.11122arXiv0811.0372WikidataQ106094314 ScholiaQ106094314MaRDI QIDQ431647
Ernie Croot, Robin Pemantle, Prasad Tetali, Andrew Granville
Publication date: 29 June 2012
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0811.0372
sieving; factorization algorithm; smooth numbers; random hypergraph; Dixon's random squares algorithm; smooth number estimates; square product
Related Items
The Most Frequent Values of the Largest Prime Divisor Function, Orienteering with one endomorphism, Small cores in 3-uniform hypergraphs, The sharp threshold for making squares, Rigorous analysis of a randomised number field sieve, Counting primitive subsets and other statistics of the divisor graph of \(\{1,2,\dots,n\}\), Running Time Predictions for Factoring Algorithms
Cites Work
- Enumerative problems inspired by Mayer's theory of cluster integrals
- Large character sums
- Running Time Predictions for Factoring Algorithms
- 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
- Dependent Sets of Constant Weight Binary Vectors
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
