Triple
T10055760
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Gröbner basis |
E208856
|
entity |
| Predicate | relatedAlgorithm |
P25130
|
FINISHED |
| Object |
F4 algorithm
The F4 algorithm is an efficient method for computing Gröbner bases using structured linear algebra techniques to speed up polynomial ideal calculations.
|
E838596
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69ca836094408190a36a1ea7e9a86fcd |
elicitation | completed |
| NER | batch_69cdcfacacd08190abe66f8bb17b92c7 |
ner | completed |
| NED1 | batch_69d29a49cb208190b56d991a523efbac |
ned_source_triple | completed |
| NED2 | batch_69d29c7ba9f081908f4614098d6c954b |
ned_description | completed |
| NEDg | batch_69d29b7430248190b8965eaf1286dd7c |
nedg | completed |
Created at: March 30, 2026, 8:57 p.m.