Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
polynomials over finite fields
|
| gptkbp:complexity |
polynomial time (expected)
|
| gptkbp:field |
gptkb:mathematics
computational algebra computer algebra |
| https://www.w3.org/2000/01/rdf-schema#label |
Cantor–Zassenhaus algorithm
|
| gptkbp:input |
square-free polynomial
|
| gptkbp:introducedIn |
1981
|
| gptkbp:language |
English
|
| gptkbp:namedAfter |
gptkb:Hans_Zassenhaus
gptkb:David_G._Cantor |
| gptkbp:output |
irreducible factors
|
| gptkbp:purpose |
factorization of polynomials
|
| gptkbp:relatedTo |
gptkb:Berlekamp's_algorithm
polynomial factorization |
| gptkbp:type |
gptkb:algorithm
|
| gptkbp:usedIn |
computer algebra systems
|
| gptkbp:bfsParent |
gptkb:Berlekamp's_algorithm
|
| gptkbp:bfsLayer |
5
|