Triple
T9867909
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Hans Zassenhaus |
E239880
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Zassenhaus algorithm for factoring polynomials over the rationals
The Zassenhaus algorithm for factoring polynomials over the rationals is a classical computational method that reduces rational polynomial factorization to modular factorization and then recombines the results using lifting techniques.
|
E827382
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69ca84e7506c819095cbde4ff16512bb |
elicitation | completed |
| NER | batch_69cdb3d34e4c81908c0fc14dd6d015cc |
ner | completed |
| NED1 | batch_69d1eae2189c81909629e4bd46097051 |
ned_source_triple | completed |
| NED2 | batch_69d1ec65d5e881909e4caa180b0f8867 |
ned_description | completed |
| NEDg | batch_69d1ebec25508190ac4c0adb629f79b0 |
nedg | completed |
Created at: March 30, 2026, 8:36 p.m.