Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Shanks'_square_forms_factorization> ?p ?o. }
Showing items 1 to 30 of
30
with 100 items per page.
- Shanks'_square_forms_factorization abstract "Shanks' square forms factorization is a method for integer factorization devised by Daniel Shanks as an improvement on Fermat's factorization method.The success of Fermat's method depends on finding integers and such that , where is the integer to be factored. An improvement (noticed by Kraitchik) is to look for integers and such that . Finding a suitable pair does not guarantee a factorization of , but it implies that is a factor of , and there is a good chance that the prime divisors of are distributed between these two factors, so that calculation of the greatest common divisor of and will give a non-trivial factor of .A practical algorithm for finding pairs which satisfy was developed by Shanks, who named it Square Forms Factorization or SQUFOF. The algorithm can be expressed in terms of continued fractions, or in terms of quadratic forms. Although there are now much more efficient factorization methods available, SQUFOF has the advantage that it is small enough to be implemented on a programmable calculator.".
- Shanks'_square_forms_factorization wikiPageExternalLink TridentFinal.pdf.
- Shanks'_square_forms_factorization wikiPageExternalLink squfof.pdf.
- Shanks'_square_forms_factorization wikiPageExternalLink shanks_analysis.pdf.
- Shanks'_square_forms_factorization wikiPageExternalLink shanks_squfof.pdf.
- Shanks'_square_forms_factorization wikiPageID "3387328".
- Shanks'_square_forms_factorization wikiPageRevisionID "587946062".
- Shanks'_square_forms_factorization hasPhotoCollection Shanks'_square_forms_factorization.
- Shanks'_square_forms_factorization subject Category:Integer_factorization_algorithms.
- Shanks'_square_forms_factorization type Abstraction100002137.
- Shanks'_square_forms_factorization type Act100030358.
- Shanks'_square_forms_factorization type Activity100407535.
- Shanks'_square_forms_factorization type Algorithm105847438.
- Shanks'_square_forms_factorization type Event100029378.
- Shanks'_square_forms_factorization type IntegerFactorizationAlgorithms.
- Shanks'_square_forms_factorization type Procedure101023820.
- Shanks'_square_forms_factorization type PsychologicalFeature100023100.
- Shanks'_square_forms_factorization type Rule105846932.
- Shanks'_square_forms_factorization type YagoPermanentlyLocatedEntity.
- Shanks'_square_forms_factorization comment "Shanks' square forms factorization is a method for integer factorization devised by Daniel Shanks as an improvement on Fermat's factorization method.The success of Fermat's method depends on finding integers and such that , where is the integer to be factored. An improvement (noticed by Kraitchik) is to look for integers and such that .".
- Shanks'_square_forms_factorization label "Factorización de formas cuadradas de Shanks".
- Shanks'_square_forms_factorization label "Shanks' square forms factorization".
- Shanks'_square_forms_factorization label "Метод квадратичных форм Шенкса".
- Shanks'_square_forms_factorization sameAs Factorización_de_formas_cuadradas_de_Shanks.
- Shanks'_square_forms_factorization sameAs m.098yt0.
- Shanks'_square_forms_factorization sameAs Q4291872.
- Shanks'_square_forms_factorization sameAs Q4291872.
- Shanks'_square_forms_factorization sameAs Shanks'_square_forms_factorization.
- Shanks'_square_forms_factorization wasDerivedFrom Shanks'_square_forms_factorization?oldid=587946062.
- Shanks'_square_forms_factorization isPrimaryTopicOf Shanks'_square_forms_factorization.