Comum · Saberes
Quadratic sieve
Integer factorization algorithm
The quadratic sieve algorithm (QS) is an integer factorization algorithm and, in practice, the second-fastest method known (after the general number field sieve). It is still the fastest for integers under 100 decimal digits or so, and is considerably simpler than the number field sieve.
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
The quadratic sieve algorithm (QS) is an integer factorization algorithm and, in practice, the second-fastest method known (after the general number field sieve). It is still the fastest for integers under 100 decimal digits or so, and is considerably simpler than the number field sieve. It is a general-purpose factorization algorithm, meaning that its running time depends solely on the size of the integer to be factored, and not on special structure or properties. It was invented by Carl Pomerance in 1981 as an improvement to Schroeppel's linear sieve.
Texto: Wikipédia em inglês, CC BY-SA 4.0. ·
Cartas próximas
-
★★★
raiz quadrada inversa rápida
Root-finding algorithm
-
Q★★★
QR algorithm
Numerical linear algebra algorithm
-
★★★
Criptografia de curva elíptica
-
C★
Crivo do corpo de números generalizado
O mais eficiente algoritmo clássico, conhecido por fatorar inteiros maiores do que 100 dígitos
-
★★★★
Método dos mínimos quadrados
-
★★
Quadtree
Tree data structure in which each internal node has exactly four children