Towards toric absolute factorization
From MaRDI portal
Publication:1030251
DOI10.1016/J.JSC.2008.03.007zbMath1180.14056OpenAlexW4300569121MaRDI QIDQ1030251
Martin Weimann, Andre Galligo, Mohamed Elkadi
Publication date: 1 July 2009
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00438275/file/EGW.pdf
Newton polytopetoric geometrybivariateirreducible factorsalgebraic interpolationabsolute polynomial factorizationsemi-numerical probabilistic algorithm
Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Computational aspects in algebraic geometry (14Q99)
Related Items (4)
A lifting and recombination algorithm for rational factorization of sparse polynomials ⋮ Concavity, Abel transform and the Abel-inverse theorem in smooth complete toric varieties ⋮ Algebraic osculation and application to factorization of sparse polynomials ⋮ Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical factorization of multivariate complex polynomials
- A simple criterion for local hypersurfaces to be algebraic
- Factoring sparse multivariate polynomials
- Approximate factorization of multivariate polynomials and absolute irreducibility testing
- On multiplication and factorization of polynomials. I: Lexicographic orderings and extreme aggregates of terms
- Lifting and recombination techniques for absolute factorization
- From an approximate to an exact absolute polynomial factorization
- Improved dense multivariate polynomial factorization algorithms
- On the complexity of sparse elimination
- Semi-numerical absolute factorization of polynomials with integer coefficients
- Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
- Reduzibilität ebener Kurven.
- Factoring polynomials via polytopes
- Complexity issues in bivariate polynomial factorization
- Factoring multivariate polynomials via partial differential equations
- Absolute irreducibility of polynomials via Newton polytopes
This page was built for publication: Towards toric absolute factorization