Complexity bound for the absolute factorization of parametric polynomials

DOI10.1007/S10958-006-0109-7MaRDI QIDQ5460915zbMATH OpenOpenAlexFDO

Authors

Publication date 20 July 2005

Published in Journal of Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/223274, http://mathnet.ru/eng/znsl/v316/p5

zbMATH Keywords

absolute irreducible polynomialalgorithmcomplexity boundfactorizationHensel lemmaparameter spaceparametric polynomialquantifier elimination

Mathematics Subject Classification ID

Quantifier elimination, model completeness, and related topics (03C10) Polynomials, factorization in commutative rings (13P05) Numerical computation of solutions to single equations (65H05) Symbolic computation and algebraic computation (68W30)

Recommendations

• On factoring parametric multivariate polynomials
• A lecture on the complexity of factoring polynomials over global fields
• Efficient absolute factorization of polynomials with parametric coefficients
• Complexity of solving parametric polynomial systems
• On computing absolutely irreducible components of algebraic varieties with parameters

Cited in

(7)

• On factoring parametric multivariate polynomials
• Complexity of solving parametric polynomial systems
• Efficient absolute factorization of polynomials with parametric coefficients
• Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
• A lecture on the complexity of factoring polynomials over global fields
• On computing absolutely irreducible components of algebraic varieties with parameters
• On factorization of parametric polynomials

This page was built for publication: Complexity bound for the absolute factorization of parametric polynomials

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