Factoring polynomials via polytopes

DOI10.1145/1005285.1005289zbMath1088.68183OpenAlexW2043135185MaRDI QIDQ4657294

Shuhong Gao, Fatima K. Abu Salem, 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

zbMATH Keywords

algorithmsexperimentation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Polynomials, factorization in commutative rings (13P05) Nonlinear algebraic or transcendental equations (65H99)

Related Items (13)

Approximating multidimensional subset sum and Minkowski decomposition of polygons ⋮ Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations ⋮ Factoring multivariate polynomials via partial differential equations ⋮ Lifting and recombination techniques for absolute factorization ⋮ Families of polynomials and their specializations ⋮ A lifting and recombination algorithm for rational factorization of sparse polynomials ⋮ Algebraic osculation and application to factorization of sparse polynomials ⋮ Sparse bivariate polynomial factorization ⋮ 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 ⋮ Parallel methods for absolute irreducibility testing ⋮ Towards toric absolute factorization ⋮ Dynamic balancing of planar mechanisms using toric geometry

This page was built for publication: Factoring polynomials via polytopes