A remark on factorisation

DOI10.1145/1089402.1089408zbMATH Open0601.12003OpenAlexW2027902872MaRDI QIDQ3735802FDOQ3735802

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

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

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)

Cited In (10)

• Trager's factorization algorithm over successive extension fields
• A Remark on the Hensel Factorization Method
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On factorisation, with a suggested new approach
• Title not available (Why is that?)
• An efficient algorithm for factoring polynomials over algebraic extension field
• Title not available (Why is that?)

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)