Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Williams_p_+_1_algorithm> ?p ?o }
Showing triples 1 to 40 of
40
with 100 triples 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 wikiPageLength "5448".
- Williams_p_+_1_algorithm wikiPageOutDegree "16".
- Williams_p_+_1_algorithm wikiPageRevisionID "583912814".
- Williams_p_+_1_algorithm wikiPageWikiLink Algebraic-group_factorisation_algorithm.
- Williams_p_+_1_algorithm wikiPageWikiLink Algebraic-group_factorisation_algorithms.
- Williams_p_+_1_algorithm wikiPageWikiLink Category:Integer_factorization_algorithms.
- Williams_p_+_1_algorithm wikiPageWikiLink Computational_number_theory.
- Williams_p_+_1_algorithm wikiPageWikiLink Cyclotomic_polynomial.
- Williams_p_+_1_algorithm wikiPageWikiLink Hugh_C._Williams.
- Williams_p_+_1_algorithm wikiPageWikiLink Integer_factorization.
- Williams_p_+_1_algorithm wikiPageWikiLink Jacobi_symbol.
- Williams_p_+_1_algorithm wikiPageWikiLink Lucas_sequence.
- Williams_p_+_1_algorithm wikiPageWikiLink Pollards_p_-_1_algorithm.
- Williams_p_+_1_algorithm wikiPageWikiLink Pollards_p_xe2x88x92_1_algorithm.
- Williams_p_+_1_algorithm wikiPageWikiLink Quadratic_field.
- Williams_p_+_1_algorithm wikiPageWikiLink Quadratic_non-residue.
- Williams_p_+_1_algorithm wikiPageWikiLink Quadratic_residue.
- Williams_p_+_1_algorithm wikiPageWikiLink Smooth_number.
- Williams_p_+_1_algorithm wikiPageWikiLinkText "''p'' + 1 method".
- Williams_p_+_1_algorithm wikiPageWikiLinkText "+1".
- Williams_p_+_1_algorithm wikiPageWikiLinkText "Williams' ''p'' + 1 algorithm".
- Williams_p_+_1_algorithm wikiPageWikiLinkText "Williams' p + 1 algorithm".
- Williams_p_+_1_algorithm hasPhotoCollection Williams_p_+_1_algorithm.
- Williams_p_+_1_algorithm wikiPageUsesTemplate Template:Citation.
- Williams_p_+_1_algorithm wikiPageUsesTemplate Template:Number_theoretic_algorithms.
- Williams_p_+_1_algorithm subject Category:Integer_factorization_algorithms.
- Williams_p_+_1_algorithm hypernym Algorithm.
- Williams_p_+_1_algorithm type Software.
- 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 "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 P+1_метод_Уильямса.
- Williams_p_+_1_algorithm sameAs Q4046134.
- Williams_p_+_1_algorithm sameAs Q4046134.
- Williams_p_+_1_algorithm wasDerivedFrom Williams_p_+_1_algorithmoldid=583912814.
- Williams_p_+_1_algorithm isPrimaryTopicOf Williams_p_+_1_algorithm.