Factorization in Z[x]

DOI10.1145/345542.345560MaRDI QIDQ3454736zbMATH OpenOpenAlexFDO

Authors John Abbott, Victor Shoup, Paul Zimmermann

Publication date 26 November 2015

Published in Proceedings of the 2000 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30)

Recommendations

• Computing all factorizations in \(\mathbb{Z}_N[x]\)
• On the factorization of \(f(n)\) for \(f(x)\) in \(\mathbb Z[x]\)
• Approximate factorization of polynomials in Z[x]
• Factorization of polynomials over \(\mathbb{Z}/(p^n)\)
• scientific article; zbMATH DE number 3968703
• Generalized factorization in \(\mathbb{Z}/m\mathbb{Z}\)
• scientific article; zbMATH DE number 3773731
• Bounds on factors in \(\mathbb Z[x]\)
• scientific article; zbMATH DE number 32160
• Prime factorization for values of cyclotomic polynomials in \({\mathbb Z}[i]\)

Cited in

(9)

• A relative van Hoeij algorithm over number fields
• On the factorization of \(f(n)\) for \(f(x)\) in \(\mathbb Z[x]\)
• [[:Publication:2926272|On Hensel's roots and a factorization formula in \(\mathbb Zx\)]]
• Improvements on the Cantor-Zassenhaus factorization algorithm.
• An efficient algorithm for the computation of Galois automorphisms
• Finding Elements With Given Factorization Lengths and Multiplicities
• Approximate factorization of polynomials in Z[x]
• Proving an execution of an algorithm correct?
• Factoring polynomials and the knapsack problem

This page was built for publication: Factorization in Z[x]

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