Triple
T9838958
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Hendrik Lenstra |
E239172
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
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.
|
E824095
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69ca84e314108190978324a4bdb959f8 |
elicitation | completed |
| NER | batch_69cdb34921b881909836ba0f5b42a27b |
ner | completed |
| NED1 | batch_69d1d5d145ac8190ad10a4328216ef54 |
ned_source_triple | completed |
| NED2 | batch_69d1d726e58c819090135d1ff275d2d8 |
ned_description | completed |
| NEDg | batch_69d1d6bb23cc81909efbeccf147018e8 |
nedg | completed |
Created at: March 30, 2026, 8:33 p.m.