Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Quadratic_Frobenius_test> ?p ?o }
Showing triples 1 to 38 of
38
with 100 triples per page.
- Quadratic_Frobenius_test abstract "The Quadratic Frobenius Test (QFT) is a probabilistic primality test to test whether a number is a probable prime. It is named after Ferdinand Georg Frobenius. The test uses the concepts of quadratic polynomials and the Frobenius automorphism. It should not be confused with the more general Frobenius test using a quadratic polynomial -- the QFT restricts the polynomials allowed based on the input, and also has other conditions that must be met. A composite passing this test is a Frobenius pseudoprime, but the converse is not necessarily true.".
- Quadratic_Frobenius_test wikiPageID "39004533".
- Quadratic_Frobenius_test wikiPageLength "3382".
- Quadratic_Frobenius_test wikiPageOutDegree "14".
- Quadratic_Frobenius_test wikiPageRevisionID "676731175".
- Quadratic_Frobenius_test wikiPageWikiLink Category:Primality_tests.
- Quadratic_Frobenius_test wikiPageWikiLink Composite_number.
- Quadratic_Frobenius_test wikiPageWikiLink Ferdinand_Georg_Frobenius.
- Quadratic_Frobenius_test wikiPageWikiLink Frobenius_automorphism.
- Quadratic_Frobenius_test wikiPageWikiLink Frobenius_endomorphism.
- Quadratic_Frobenius_test wikiPageWikiLink Frobenius_pseudoprime.
- Quadratic_Frobenius_test wikiPageWikiLink Ivan_Damgård.
- Quadratic_Frobenius_test wikiPageWikiLink Jacobi_symbol.
- Quadratic_Frobenius_test wikiPageWikiLink Modular_arithmetic.
- Quadratic_Frobenius_test wikiPageWikiLink Multiplicative_group_of_integers_modulo_n.
- Quadratic_Frobenius_test wikiPageWikiLink Primality_test.
- Quadratic_Frobenius_test wikiPageWikiLink Probabilistic_algorithm.
- Quadratic_Frobenius_test wikiPageWikiLink Probable_prime.
- Quadratic_Frobenius_test wikiPageWikiLink Quadratic_function.
- Quadratic_Frobenius_test wikiPageWikiLink Quadratic_polynomial.
- Quadratic_Frobenius_test wikiPageWikiLink Randomized_algorithm.
- Quadratic_Frobenius_test wikiPageWikiLinkText "Quadratic Frobenius test".
- Quadratic_Frobenius_test wikiPageWikiLinkText "quadratic Frobenius test".
- Quadratic_Frobenius_test hasPhotoCollection Quadratic_Frobenius_test.
- Quadratic_Frobenius_test wikiPageUsesTemplate Template:Number-theoretic_algorithms.
- Quadratic_Frobenius_test wikiPageUsesTemplate Template:Reflist.
- Quadratic_Frobenius_test wikiPageUsesTemplate Template:Rp.
- Quadratic_Frobenius_test subject Category:Primality_tests.
- Quadratic_Frobenius_test hypernym Test.
- Quadratic_Frobenius_test type Cricketer.
- Quadratic_Frobenius_test type Algorithm.
- Quadratic_Frobenius_test comment "The Quadratic Frobenius Test (QFT) is a probabilistic primality test to test whether a number is a probable prime. It is named after Ferdinand Georg Frobenius. The test uses the concepts of quadratic polynomials and the Frobenius automorphism. It should not be confused with the more general Frobenius test using a quadratic polynomial -- the QFT restricts the polynomials allowed based on the input, and also has other conditions that must be met.".
- Quadratic_Frobenius_test label "Quadratic Frobenius test".
- Quadratic_Frobenius_test sameAs m.0tkjwpv.
- Quadratic_Frobenius_test sameAs Q17083547.
- Quadratic_Frobenius_test sameAs Q17083547.
- Quadratic_Frobenius_test wasDerivedFrom Quadratic_Frobenius_test?oldid=676731175.
- Quadratic_Frobenius_test isPrimaryTopicOf Quadratic_Frobenius_test.