Irreducibility Tests in \(\mathbb F_p[T]\)¶
Conrad, K. Irreducibility Tests in $\mathbb F_p[T]$.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Trial Division
- The procedure is not the factorization itself, and finding one divisor is not necessarily a complete prime-factorization result.
This sourceThe original explicitly calls the bounded monic-polynomial divisibility test “trial division.”
- The procedure is not the factorization itself, and finding one divisor is not necessarily a complete prime-factorization result.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
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:07480829b045 · see in the full table