Triple
T8448944
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Adleman–Pomerance–Rumely primality test |
E199750
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
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.
|
E735950
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69ca83170f9081909cd98f55614c6476 |
elicitation | completed |
| NER | batch_69cbe445b7988190b53ae45070c70d1d |
ner | completed |
| NED1 | batch_69ce39b528f08190a0627cb17a0ffef9 |
ned_source_triple | completed |
| NED2 | batch_69ce3c698210819098367fdacadc936a |
ned_description | completed |
| NEDg | batch_69ce3bb440a8819085352ea50c39c109 |
nedg | completed |
Created at: March 30, 2026, 6:09 p.m.