Absolute Factorization of Polynomials: A Geometric Approach
DOI10.1137/0220001zbMATH Open0716.68052OpenAlexW2103096885MaRDI QIDQ3204047FDOQ3204047
Authors: Dominique Duval 
Publication date: 1991
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0220001
Recommendations
- scientific article; zbMATH DE number 2151216
- Factorization of absolutely continuous polynomials
- From an approximate to an exact absolute polynomial factorization
- Factoring polynomials via polytopes
- Polynomial factorizations
- scientific article; zbMATH DE number 3880116
- On polynomial factorization
- On the factorization of polynomials
- Efficient absolute factorization of polynomials with parametric coefficients
Symbolic computation and algebraic computation (68W30) Divisors, linear systems, invertible sheaves (14C20) Polynomials in real and complex fields: factorization (12D05) Algebraic field extensions (12F05) Algebraic functions and function fields in algebraic geometry (14H05)
Cited In (12)
- Factoring bivariate polynomials using adjoints
- Comments on \textit{Integration of algebraic functions}
- An empirical study of cache-oblivious polygon indecomposability testing
- Good reduction of Puiseux series and applications
- Factoring multivariate polynomials via partial differential equations
- Semi-numerical absolute factorization of polynomials with integer coefficients
- Parallel methods for absolute irreducibility testing
- Linear differential operators for polynomial equations
- Probabilistic absolute irreducibility test for polynomials
- A note on Gao's algorithm for polynomial factorization
- Lifting and recombination techniques for absolute factorization
- Title not available (Why is that?)
This page was built for publication: Absolute Factorization of Polynomials: A Geometric Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3204047)
