Triple
T7174363
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Berlekamp–Massey algorithm |
E167281
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
Euclidean algorithm for polynomials
The Euclidean algorithm for polynomials is a procedure that repeatedly applies polynomial division to compute the greatest common divisor of two polynomials over a given field or ring.
|
E646780
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69c68889a2748190a316c5e65360361a |
elicitation | completed |
| NER | batch_69c6e88d770c8190b8d06dcd08447c08 |
ner | completed |
| NED1 | batch_69c7b921b1e48190b25c1337f6187174 |
ned_source_triple | completed |
| NED2 | batch_69c7ba1a770c819085a25eb796312822 |
ned_description | completed |
| NEDg | batch_69c7b9b0867081909be41ffb8b088e16 |
nedg | completed |
Created at: March 27, 2026, 2:48 p.m.