Factoring polynomials via polytopes

DOI10.1145/1005285.1005289MaRDI QIDQ4657294zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmsexperimentation

Mathematics Subject Classification ID

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)

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; zbMATH DE number 89355

Cited in

(25)

• Factoring Quartic Polynomials: A Lost Art
• Factoring sparse bivariate polynomials using the priority queue
• Factoring bivariate polynomials using adjoints
• scientific article; zbMATH DE number 1150448 (Why is no real title available?)
• An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
• Factoring multivariate polynomials with many factors and huge coefficients
• 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 non-monic polynomials represented by black boxes
• Factoring multivariate polynomials via partial differential equations
• Absolute Factorization of Polynomials: A Geometric Approach
• Towards toric absolute factorization
• Families of polynomials and their specializations
• Approximating multidimensional subset sum and Minkowski decomposition of polygons
• Parallel methods for absolute irreducibility testing
• Dynamic balancing of planar mechanisms using toric geometry
• Sparse bivariate polynomial factorization
• Bivariate factorization using a critical fiber
• Extracting sparse factors from multivariate integral polynomials
• 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)