Factorization and Primality Testing
E1316093
UNEXPLORED
"Factorization and Primality Testing" is a mathematical work that explores algorithms and theory for decomposing integers into prime factors and determining whether numbers are prime.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Factorization and Primality Testing canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T18282758 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Factorization and Primality Testing Context triple: [David Bressoud, notableWork, Factorization and Primality Testing]
-
A.
Selfridge–Conway primality test
The Selfridge–Conway primality test is a probabilistic algorithm in number theory used to determine whether a given integer is prime.
-
B.
AKS primality test
The AKS primality test is a landmark deterministic polynomial-time algorithm that can conclusively determine whether a number is prime without relying on unproven assumptions.
-
C.
Adleman–Pomerance–Rumely primality test
The Adleman–Pomerance–Rumely primality test is an early deterministic algorithm in computational number theory used to determine whether a given number is prime, notable for its theoretical importance in the development of modern primality testing methods.
-
D.
Lenstra elliptic-curve factorization method
The Lenstra elliptic-curve factorization method is an integer factorization algorithm that uses properties of elliptic curves over finite fields to efficiently find nontrivial factors of large numbers, especially those with relatively small prime divisors.
-
E.
Miller primality test
The Miller primality test is a randomized algorithm used to determine whether a number is prime with high confidence, forming the basis of the widely used Miller–Rabin primality test in computational number theory and cryptography.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Factorization and Primality Testing Target entity description: "Factorization and Primality Testing" is a mathematical work that explores algorithms and theory for decomposing integers into prime factors and determining whether numbers are prime.
-
A.
Selfridge–Conway primality test
The Selfridge–Conway primality test is a probabilistic algorithm in number theory used to determine whether a given integer is prime.
-
B.
AKS primality test
The AKS primality test is a landmark deterministic polynomial-time algorithm that can conclusively determine whether a number is prime without relying on unproven assumptions.
-
C.
Adleman–Pomerance–Rumely primality test
The Adleman–Pomerance–Rumely primality test is an early deterministic algorithm in computational number theory used to determine whether a given number is prime, notable for its theoretical importance in the development of modern primality testing methods.
-
D.
Lenstra elliptic-curve factorization method
The Lenstra elliptic-curve factorization method is an integer factorization algorithm that uses properties of elliptic curves over finite fields to efficiently find nontrivial factors of large numbers, especially those with relatively small prime divisors.
-
E.
Miller primality test
The Miller primality test is a randomized algorithm used to determine whether a number is prime with high confidence, forming the basis of the widely used Miller–Rabin primality test in computational number theory and cryptography.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.