Concept information
Preferred term
Dixon's factorization method
Definition
-
In number theory, Dixon's factorization method (also Dixon's random squares method or Dixon's algorithm) is a general-purpose integer factorization algorithm; it is the prototypical factor base method. Unlike for other factor base methods, its run-time bound comes with a rigorous proof that does not rely on conjectures about the smoothness properties of the values taken by a polynomial.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Dixon%27s_factorization_method)
Broader concept
Synonym(s)
- Dixon's algorithm
- Dixon's random squares method
In other languages
-
French
-
algorithme de Dixon
URI
http://data.loterre.fr/ark:/67375/PSR-HRZDCPJ8-F
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}