About: Adleman–Pomerance–Rumely primality test

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Adleman–Pomerance–Rumely primality test Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

In computational number theory, the Adleman–Pomerance–Rumely primality test is an algorithm for determining whether a number is prime. Unlike other, more efficient algorithms for this purpose, it avoids the use of random numbers, so it is a deterministic primality test. It is named after its discoverers, Leonard Adleman, Carl Pomerance, and Robert Rumely. The test involves arithmetic in cyclotomic fields. It was later improved by Henri Cohen and Hendrik Willem Lenstra, commonly referred to as APR-CL. It can test primality of an integer n in time:

Attributes	Values
rdfs:label	Adleman–Pomerance–Rumely primality test (en)
rdfs:comment	In computational number theory, the Adleman–Pomerance–Rumely primality test is an algorithm for determining whether a number is prime. Unlike other, more efficient algorithms for this purpose, it avoids the use of random numbers, so it is a deterministic primality test. It is named after its discoverers, Leonard Adleman, Carl Pomerance, and Robert Rumely. The test involves arithmetic in cyclotomic fields. It was later improved by Henri Cohen and Hendrik Willem Lenstra, commonly referred to as APR-CL. It can test primality of an integer n in time: (en)
sameAs	Adleman–Pomerance–Rumely primality test
dbp:wikiPageUsesTemplate	dbt:Algorithm-stub dbt:Cite_book dbt:Cite_journal dbt:Number_theoretic_algorithms dbt:Numtheory-stub
Subject	Primality tests
Link from a Wikipage to an external page	https://web.archive.org/web/20190929045643/http:/pari.math.u-bordeaux.fr/ http://jpenne.free.fr/index2.html http://www.alpertron.com.ar/ECM.HTM http://primes.utm.edu/prove/prove4_1.html http://sourceforge.net/projects/mpzaprcl/ https://archive.org/details/primenumberscomp00ries https://archive.org/details/primenumberscomp00ries/page/n149
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Adleman–Pomerance–Rumely_primality_test?oldid=1067262468&ns=0
Wikipage page ID	8198761 (xsd:integer)
page length (characters) of wiki page	2683 (xsd:nonNegativeInteger)
Wikipage revision ID	1067262468 (xsd:integer)
Link from a Wikipage to another Wikipage	Algorithm Annals of Mathematics Carl Pomerance Primality tests Leonard Adleman Cyclotomic field Primality test Prime number Adleman–Pomerance–Rumely primality test Computational number theory Hendrik Lenstra Henri Cohen (number theorist) Deterministic algorithm UBASIC Mathematics of Computation
has abstract	In computational number theory, the Adleman–Pomerance–Rumely primality test is an algorithm for determining whether a number is prime. Unlike other, more efficient algorithms for this purpose, it avoids the use of random numbers, so it is a deterministic primality test. It is named after its discoverers, Leonard Adleman, Carl Pomerance, and Robert Rumely. The test involves arithmetic in cyclotomic fields. It was later improved by Henri Cohen and Hendrik Willem Lenstra, commonly referred to as APR-CL. It can test primality of an integer n in time: (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Adleman–Pomerance–Rumely_primality_test
is Wikipage redirect of	APRCL Adleman-Pomerance-Rumely primality test Adleman-Rumely primality test APR-CL APRT-CL APR primality test APR test
is Link from a Wikipage to another Wikipage of	AKS primality test APR APRCL Adleman-Pomerance-Rumely primality test Carl Pomerance Leonard Adleman List of University of Georgia people Miller–Rabin primality test Integer factorization Adleman-Rumely primality test APR-CL APRT-CL APR primality test APR test
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Adleman–Pomerance–Rumely_primality_test

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (71 GB total memory, 2 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software