Parallel methods for absolute irreducibility testing

DOI10.1007/s11227-008-0205-1zbMath1187.65049OpenAlexW1987607498MaRDI QIDQ1009361

Fatima K. Abu Salem, Laurence Tianruo Yang

Publication date: 31 March 2009

Published in: The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11227-008-0205-1

zbMATH Keywords

Parallel algorithmsNewton polytopesAbsolute irreducibilityBivariate polynomialsBulk synchronous modelMultivariate polynomials

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel numerical computation (65Y05) Numerical computation of roots of polynomial equations (65H04)

Uses Software

• BSPlib
• BSPedupack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic function fields and codes
• Factoring multivariate polynomials over finite fields
• An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
• Über ein euklidisch-geometrisches Problem von B. Grünbaum
• Absolute Factorization of Polynomials: A Geometric Approach
• Factorization of Multivariate Polynomials Over Finite Fields
• Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
• Factoring Multivariate Polynomials over Algebraic Number Fields
• Factoring polynomials via polytopes
• Factoring multivariate polynomials via partial differential equations
• Absolute irreducibility of polynomials via Newton polytopes
• Decomposition of polytopes and polynomials