Triple
T7115641
| 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)
GF(p) is a finite field consisting of p elements, where p is a prime number, that forms the basic setting for modular arithmetic and many algebraic and cryptographic constructions.
|
E641824
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69c6888227bc8190a1394679e3116f90 |
elicitation | completed |
| NER | batch_69c6e5f401b881909ef4c2ab1e0750db |
ner | completed |
| NED1 | batch_69c79cbfc7a08190ab07f3d65aa79f16 |
ned_source_triple | completed |
| NED2 | batch_69c79d63b6dc8190b3b52ef6566ba490 |
ned_description | completed |
| NEDg | batch_69c79d0215888190b0e59c2584358a05 |
nedg | completed |
Created at: March 27, 2026, 2:43 p.m.