Triple
T7115642
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Berlekamp’s algorithm for factoring polynomials over finite fields |
E165811
|
entity |
| Predicate | worksOver |
P23104
|
FINISHED |
| Object |
GF(p^m)
GF(p^m) is a finite field with p^m elements, where p is a prime and m is a positive integer, widely used in algebra, coding theory, and cryptography.
|
E643835
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69c6888227bc8190a1394679e3116f90 |
elicitation | completed |
| NER | batch_69c6e5f401b881909ef4c2ab1e0750db |
ner | completed |
| NED1 | batch_69c7a32870e481909472f8fcd2501289 |
ned_source_triple | completed |
| NED2 | batch_69c7a4be1cbc8190a7e4eb91d604f994 |
ned_description | completed |
| NEDg | batch_69c7a390cf6c8190902bdfd0ff536093 |
nedg | completed |
Created at: March 27, 2026, 2:43 p.m.