A remark on factorisation

DOI10.1145/1089402.1089408zbMath0601.12003OpenAlexW2027902872MaRDI QIDQ3735802

John Abbott, James H. Davenport, Russell J. Bradford

Publication date: 1985

Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1089402.1089408

zbMATH Keywords

computational number theorydivisibility tests for polynomialsSwinnerton-Dyer polynomialsTrager's algorithm

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05) Polynomials (irreducibility, etc.) (11R09) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items (1)

An efficient algorithm for factoring polynomials over algebraic extension field

This page was built for publication: A remark on factorisation