Practical polynomial factoring in polynomial time

DOI10.1145/1993886.1993914MaRDI QIDQ5254167zbMATH OpenOpenAlexFDO

Authors

Publication date 9 June 2015

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

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

zbMATH Keywords

factoring polynomialslattice reductionsymbolic computation

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• Polynomial factorization: Sharp bounds, efficient algorithms
• scientific article; zbMATH DE number 1273637
• On the deterministic complexity of factoring polynomials
• Schemes for deterministic polynomial factoring
• Polynomial factorization algorithms over number fields
• Subquadratic-time factoring of polynomials over finite fields
• scientific article; zbMATH DE number 1263216
• scientific article; zbMATH DE number 1594303
• On the deterministic complexity of factoring polynomials over finite fields
• Factoring polynomials over arbitrary finite fields

Cited in

(4)

• Computing the multilinear factors of lacunary polynomials without heights
• The complexity of divisibility
• Calculation of the fundamental S-units in hyperelliptic fields of genus 2 and the torsion problem in the Jacobians of hyperelliptic curves
• Computing Galois groups

This page was built for publication: Practical polynomial factoring in polynomial time

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