Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Continued_fraction_factorization> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- Continued_fraction_factorization abstract "In number theory, the continued fraction factorization method (CFRAC) is an integer factorization algorithm. It is a general-purpose algorithm, meaning that it is suitable for factoring any integer n, not depending on special form or properties. It was described by D. H. Lehmer and R. E. Powers in 1931, and developed as a computer algorithm by Michael A. Morrison and John Brillhart in 1975.The continued fraction method is based on Dixon's factorization method. It uses convergents in the regular continued fraction expansion of.Since this is a quadratic irrational, the continued fraction must be periodic (unless n is square, in which case the factorization is obvious).It has a time complexity of , in the O and L notations.".
- Continued_fraction_factorization wikiPageID "1335392".
- Continued_fraction_factorization wikiPageRevisionID "593851184".
- Continued_fraction_factorization hasPhotoCollection Continued_fraction_factorization.
- Continued_fraction_factorization subject Category:Integer_factorization_algorithms.
- Continued_fraction_factorization type Abstraction100002137.
- Continued_fraction_factorization type Act100030358.
- Continued_fraction_factorization type Activity100407535.
- Continued_fraction_factorization type Algorithm105847438.
- Continued_fraction_factorization type Event100029378.
- Continued_fraction_factorization type IntegerFactorizationAlgorithms.
- Continued_fraction_factorization type Procedure101023820.
- Continued_fraction_factorization type PsychologicalFeature100023100.
- Continued_fraction_factorization type Rule105846932.
- Continued_fraction_factorization type YagoPermanentlyLocatedEntity.
- Continued_fraction_factorization comment "In number theory, the continued fraction factorization method (CFRAC) is an integer factorization algorithm. It is a general-purpose algorithm, meaning that it is suitable for factoring any integer n, not depending on special form or properties. It was described by D. H. Lehmer and R. E. Powers in 1931, and developed as a computer algorithm by Michael A. Morrison and John Brillhart in 1975.The continued fraction method is based on Dixon's factorization method.".
- Continued_fraction_factorization label "Continued fraction factorization".
- Continued_fraction_factorization label "Factorización con fracciones continuas".
- Continued_fraction_factorization label "Kettenbruchmethode".
- Continued_fraction_factorization label "Факторизация методом непрерывных дробей".
- Continued_fraction_factorization sameAs Kettenbruchmethode.
- Continued_fraction_factorization sameAs Factorización_con_fracciones_continuas.
- Continued_fraction_factorization sameAs m.04tnh5.
- Continued_fraction_factorization sameAs Q1739928.
- Continued_fraction_factorization sameAs Q1739928.
- Continued_fraction_factorization sameAs Continued_fraction_factorization.
- Continued_fraction_factorization wasDerivedFrom Continued_fraction_factorization?oldid=593851184.
- Continued_fraction_factorization isPrimaryTopicOf Continued_fraction_factorization.