Polynomial factorization: Sharp bounds, efficient algorithms

DOI10.1006/JSCO.1993.1028MaRDI QIDQ689110zbMATH OpenOpenAlexFDO

Authors Bernard Beauzamy, Vilmar Trevisan, Paul S. Wang

Publication date 16 December 1993

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jsco.1993.1028

zbMATH Keywords

efficient algorithmpolynomial factorization\(p\)-adic lifting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Algebraic number theory computations (11Y40) Polynomials, factorization in commutative rings (13P05)

Recommendations

• A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
• scientific article; zbMATH DE number 1643926
• scientific article; zbMATH DE number 4069018
• Publication:4892927
• Fast Hensel's lifting implementation using partial fraction decomposition

Cited in

(10)

• scientific article; zbMATH DE number 4208240 (Why is no real title available?)
• Decision making beyond arrow's “impossibility theorem,” with the analysis of effects of collusion and mutual attraction
• Each univariate complex polynomial has a ‘big’ factor
• Practical polynomial factoring in polynomial time
• Sharp precision in Hensel lifting for bivariate polynomial factorization
• A history of solving some famous problems in mathematical analysis
• Single-factor coefficient bounds
• Algorithms for adaptive factorization of polynomials
• On 7th Smale's problem
• Bounds on factors in \(\mathbb Z[x]\)

This page was built for publication: Polynomial factorization: Sharp bounds, efficient algorithms

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