New Algorithms for Polynomial Square-Free Decomposition over the Integers

DOI10.1137/0208022zbMath0415.10050OpenAlexW2006694037MaRDI QIDQ3050524

Paul S. Wang, Barry M. Trager

Publication date: 1979

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0208022

zbMATH Keywords

polynomial factoringsquare-free decompositionChinese remainder algorithmlucky evaluationp-adic construction

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Polynomials in real and complex fields: factorization (12D05) Congruences; primitive roots; residue systems (11A07) Algorithms in computer science (68W99)

Related Items (1)

Products of polynomials and a priori estimates for coefficients in polynomial decompositions: A sharp result

This page was built for publication: New Algorithms for Polynomial Square-Free Decomposition over the Integers