Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Williams'_p_+_1_algorithm> ?p ?o. }
Showing items 1 to 16 of
16
with 100 items per page.
- Williams'_p_+_1_algorithm abstract "In computational number theory, Williams' p + 1 algorithm is an integer factorization algorithm, one of the family of algebraic-group factorisation algorithms. It was invented by Hugh C. Williams in 1982. It works well if the number N to be factored contains one or more prime factors p such that p + 1is smooth, i.e. p + 1 contains only small factors. It uses Lucas sequences to perform exponentiation in a quadratic field.It is analogous to Pollard's p − 1 algorithm.".
- Williams'_p_+_1_algorithm wikiPageExternalLink P_Plus_1_Factorization_Method.
- Williams'_p_+_1_algorithm wikiPageID "1916573".
- Williams'_p_+_1_algorithm wikiPageRevisionID "583912814".
- Williams'_p_+_1_algorithm hasPhotoCollection Williams'_p_+_1_algorithm.
- Williams'_p_+_1_algorithm subject Category:Integer_factorization_algorithms.
- Williams'_p_+_1_algorithm comment "In computational number theory, Williams' p + 1 algorithm is an integer factorization algorithm, one of the family of algebraic-group factorisation algorithms. It was invented by Hugh C. Williams in 1982. It works well if the number N to be factored contains one or more prime factors p such that p + 1is smooth, i.e. p + 1 contains only small factors. It uses Lucas sequences to perform exponentiation in a quadratic field.It is analogous to Pollard's p − 1 algorithm.".
- Williams'_p_+_1_algorithm label "Algoritmo p + 1 de Williams".
- Williams'_p_+_1_algorithm label "P+1 метод Уильямса".
- Williams'_p_+_1_algorithm label "Williams' p + 1 algorithm".
- Williams'_p_+_1_algorithm sameAs Algoritmo_p_+_1_de_Williams.
- Williams'_p_+_1_algorithm sameAs m.065xw7.
- Williams'_p_+_1_algorithm sameAs Q4046134.
- Williams'_p_+_1_algorithm sameAs Q4046134.
- Williams'_p_+_1_algorithm wasDerivedFrom Williams'_p_+_1_algorithm?oldid=583912814.
- Williams'_p_+_1_algorithm isPrimaryTopicOf Williams'_p_+_1_algorithm.