https://doi.org/10.1017/CBO9781139856065¶
von zur Gathen, J., & Gerhard, J. (2013). https://doi.org/10.1017/CBO9781139856065. Modern Computer Algebra.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Square-Free Element
- where each \(q_j\) is square-free and the nonunit \(q_j\) are pairwise relatively prime.
This sourceAuthoritative treatment of square-free polynomial decomposition, gcd/derivative methods, characteristic-dependent algorithms, and its role in factorization.
- where each \(q_j\) is square-free and the nonunit \(q_j\) are pairwise relatively prime.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:d203193f3e4d · see in the full table