Factoring polynomials via polytopes
DOI10.1145/1005285.1005289zbMATH Open1088.68183OpenAlexW2043135185MaRDI QIDQ4657294FDOQ4657294
Authors: Fatima K. Abu Salem, Shuhong Gao, Alan G. B. Lauder 
Publication date: 14 March 2005
Published in: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1005285.1005289
Recommendations
- Integral polytopes and polynomial factorization
- Polynomial factorizations
- scientific article; zbMATH DE number 3880116
- On polynomial factorization
- Publication:4892927
- On the factorization of polynomials
- Decomposition of polytopes and polynomials
- scientific article; zbMATH DE number 1276815
- scientific article
Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16) Polynomials, factorization in commutative rings (13P05) Nonlinear algebraic or transcendental equations (65H99)
Cited In (19)
- Factoring Quartic Polynomials: A Lost Art
- Title not available (Why is that?)
- An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
- Gcd of multivariate polynomials via Newton polytopes
- High performance implementation of factoring multivariate polynomials based on NTL
- A note on the preconditioning for factorization of homogeneous polynomials
- Algebraic osculation and application to factorization of sparse polynomials
- Topology and factorization of polynomials
- A lifting and recombination algorithm for rational factorization of sparse polynomials
- Factoring multivariate polynomials via partial differential equations
- Absolute Factorization of Polynomials: A Geometric Approach
- Towards toric absolute factorization
- Approximating multidimensional subset sum and Minkowski decomposition of polygons
- Families of polynomials and their specializations
- Parallel methods for absolute irreducibility testing
- Dynamic balancing of planar mechanisms using toric geometry
- Sparse bivariate polynomial factorization
- Lifting and recombination techniques for absolute factorization
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
This page was built for publication: Factoring polynomials via polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4657294)
