Polynomial factorization: Sharp bounds, efficient algorithms

DOI10.1006/JSCO.1993.1028zbMath0801.12007OpenAlexW2052120705MaRDI QIDQ689110

Paul S. Wang, Vilmar Trevisan, Bernard Beauzamy

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

polynomial factorizationefficient algorithm\(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)

Related Items (5)

Single-factor coefficient bounds ⋮ Each univariate complex polynomial has a ‘big’ factor ⋮ A history of solving some famous problems in mathematical analysis ⋮ Decision making beyond arrow's “impossibility theorem,” with the analysis of effects of collusion and mutual attraction ⋮ Unnamed Item

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