Skip to main

Mathematics (thesaurus)

Search from vocabulary

Concept information

number > elementary arithmetic > operation > factorization > Dixon's factorization method
algebra > elementary algebra > operation > factorization > Dixon's factorization method
number > number theory > algebraic number theory > modular arithmetic > Dixon's factorization method

Término preferido

Dixon's factorization method  

Definición

  • 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)

Etiquetas alternativas

  • Dixon's algorithm
  • Dixon's random squares method

En otras lenguas

URI

http://data.loterre.fr/ark:/67375/PSR-HRZDCPJ8-F

Descargue este concepto:

RDF/XML TURTLE JSON-LD Creado 28/8/23, última modificación 18/10/24