On factoring parametric multivariate polynomials

DOI10.1016/j.aam.2010.03.006zbMath1200.11096OpenAlexW2014017290MaRDI QIDQ1958945

Ali Ayad

Publication date: 30 September 2010

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2010.03.006

zbMATH Keywords

symbolic computationcomplexity analysisparametric polynomialspolynomial absolute factorization

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials in number theory (11C08) Polynomials in real and complex fields: factorization (12D05) Parametrization (Chow and Hilbert schemes) (14C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
• Factorization of polynomials over a finite field and the solution of systems of algebraic equations
• A new algorithm for discussing Gröbner bases with parameters.
• On Hensel factorization. I
• Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
• Algorithms in real algebraic geometry

This page was built for publication: On factoring parametric multivariate polynomials