Primality Testing for Beginners (original) (raw)
Primality Testing for Beginners is an undergraduate-level mathematics book on primality tests, methods for testing whether a given number is a prime number, centered on the AKS primality test, the first method to solve this problem in polynomial time. It was written by Lasse Rempe-Gillen and Rebecca Waldecker, and originally published in German as Primzahltests für Einsteiger: Zahlentheorie, Algorithmik, Kryptographie (Vieweg+Teubner, 2009). It was translated into English as Primality Testing for Beginners and published in 2014 by the American Mathematical Society, as volume 70 of their Student Mathematical Library book series. A second German-language edition was publisher by Springer in 2016.
Property | Value |
---|---|
dbo:abstract | Primality Testing for Beginners is an undergraduate-level mathematics book on primality tests, methods for testing whether a given number is a prime number, centered on the AKS primality test, the first method to solve this problem in polynomial time. It was written by Lasse Rempe-Gillen and Rebecca Waldecker, and originally published in German as Primzahltests für Einsteiger: Zahlentheorie, Algorithmik, Kryptographie (Vieweg+Teubner, 2009). It was translated into English as Primality Testing for Beginners and published in 2014 by the American Mathematical Society, as volume 70 of their Student Mathematical Library book series. A second German-language edition was publisher by Springer in 2016. (en) |
dbo:wikiPageID | 66154359 (xsd:integer) |
dbo:wikiPageLength | 5551 (xsd:nonNegativeInteger) |
dbo:wikiPageRevisionID | 995411563 (xsd:integer) |
dbo:wikiPageWikiLink | dbr:Prime_number_theorem dbr:Quicksort dbr:Monte_Carlo_algorithm dbr:NP_(complexity) dbr:Primality_test dbr:Binomial_theorem dbc:2009_non-fiction_books dbr:Computability dbr:Cryptography dbr:Fundamental_theorem_of_arithmetic dbr:German_language dbr:Greatest_common_divisor dbr:Modular_arithmetic dbr:Sieve_of_Eratosthenes dbr:Computational_complexity_theory dbr:Polynomial_identity_testing dbc:Mathematics_books dbr:Las_Vegas_algorithm dbr:AKS_primality_test dbr:American_Mathematical_Society dbr:Euclidean_algorithm dbr:Fermat's_little_theorem dbr:Fermat_primality_test dbr:Number_theory dbr:Prime_number dbc:Primality_tests dbr:Chinese_remainder_theorem dbr:Schwartz–Zippel_lemma dbr:Polynomial dbr:Polynomial_time dbr:Miller–Rabin_primality_test dbr:Rebecca_Waldecker dbr:Lasse_Rempe-Gillen |
dbp:wikiPageUsesTemplate | dbt:Italic_title dbt:R dbt:Reflist |
dct:subject | dbc:2009_non-fiction_books dbc:Mathematics_books dbc:Primality_tests |
rdfs:comment | Primality Testing for Beginners is an undergraduate-level mathematics book on primality tests, methods for testing whether a given number is a prime number, centered on the AKS primality test, the first method to solve this problem in polynomial time. It was written by Lasse Rempe-Gillen and Rebecca Waldecker, and originally published in German as Primzahltests für Einsteiger: Zahlentheorie, Algorithmik, Kryptographie (Vieweg+Teubner, 2009). It was translated into English as Primality Testing for Beginners and published in 2014 by the American Mathematical Society, as volume 70 of their Student Mathematical Library book series. A second German-language edition was publisher by Springer in 2016. (en) |
rdfs:label | Primality Testing for Beginners (en) |
owl:sameAs | wikidata:Primality Testing for Beginners https://global.dbpedia.org/id/FNK7m |
prov:wasDerivedFrom | wikipedia-en:Primality_Testing_for_Beginners?oldid=995411563&ns=0 |
foaf:isPrimaryTopicOf | wikipedia-en:Primality_Testing_for_Beginners |
is dbo:wikiPageWikiLink of | dbr:Rebecca_Waldecker |
is foaf:primaryTopic of | wikipedia-en:Primality_Testing_for_Beginners |