A remark on factorisation

DOI10.1145/1089402.1089408MaRDI QIDQ3735802zbMATH OpenOpenAlexFDO

Authors John Abbott, Russell Bradford, James H. Davenport

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

Recommendations

• scientific article; zbMATH DE number 1276815
• scientific article; zbMATH DE number 1594303
• scientific article; zbMATH DE number 1253982
• scientific article; zbMATH DE number 3858405
• Factoring polynomials over global fields

Cited in

(10)

• On factorisation, with a suggested new approach
• An efficient algorithm for factoring polynomials over algebraic extension field
• scientific article; zbMATH DE number 4212103 (Why is no real title available?)
• Trager's factorization algorithm over successive extension fields
• scientific article; zbMATH DE number 19493 (Why is no real title available?)
• scientific article; zbMATH DE number 5943312 (Why is no real title available?)
• scientific article; zbMATH DE number 5251810 (Why is no real title available?)
• scientific article; zbMATH DE number 3114024 (Why is no real title available?)
• A Remark on the Hensel Factorization Method
• scientific article; zbMATH DE number 3968702 (Why is no real title available?)

This page was built for publication: A remark on factorisation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3735802)