Quadratic sieve

Summary

Quadratic sieve is an integer factorization algorithm^[1]. It draws 92 Wikipedia views per month (integer_factorization_algorithm category, ranking #2 of 6).^[2]

Key Facts

• Quadratic sieve is credited with the discovery of Carl Pomerance^[3].
• Quadratic sieve's instance of is recorded as integer factorization algorithm^[4].
• Quadratic sieve's time of discovery or invention is recorded as +1981-00-00T00:00:00Z^[5].
• Quadratic sieve's Freebase ID is recorded as /m/02s9bn^[6].
• Quadratic sieve's defining formula is recorded as e^{(1 + o(1))\sqrt{\ln n \ln\ln n}} =L_n\left[1/2,1\right]^[7].
• Quadratic sieve's MathWorld ID is recorded as QuadraticSieve^[8].
• Quadratic sieve's maintained by WikiProject is recorded as WikiProject Mathematics^[9].
• Quadratic sieve's Microsoft Academic ID is recorded as 189830335^[10].

Body

Designation and Status

Quadratic sieve's instance of is recorded as integer factorization algorithm^[4].

Why It Matters

Quadratic sieve draws 92 Wikipedia views per month (integer_factorization_algorithm category, ranking #2 of 6).^[2] It has Wikipedia articles in 15 language editions, a strong signal of global cultural recognition.^[11] It is known by 10 alternative names across languages and contexts.^[12]